void quick_sort(int *arr,int n){
int i,j,v,tmp;
if(n>1){
i = -1;
j = n-1;
v = arr[n-1];
while(1){
while(arr[++i] < v);
while(arr[--j] > v);
if(i>=j) break;
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
tmp = arr[i];
arr[i] = arr[n-1];
arr[n-1] = tmp;
quick_sort(arr,i);
quick_sort(arr+i+1,n-i-1);
}
///////////////////////////////////////////////////////
¾î¶»°Ô µ¹¾Æ°¡´ÂÁö Çؼ®µµ ÇØÁÖ½É ´õ °¨»çÇÏ°Ú½À´Ï´Ù......
|