int partition(double a[], int low, int high){
double tmp = a[low];
while(low < high){
while(low<high&&a[high]>=tmp){
high--;
}
a[low] = a[high];
while(low<high&&a[low]<=tmp){
low++;
}
a[high] = a[low];
}
a[low] = tmp;
return low;
}
void quickSort(double a[], int low, int high){
if(low >= high){
return;
}
int pivot = partition(a, low, high);
quickSort(a, low, pivot-1);
quickSort(a, pivot+1, high);
}
手写快排
最新推荐文章于 2024-08-20 13:59:19 发布