int arr[10]; //需要排序的数组
int quicksort(int left, int right){
if(left < right){
int key = arr[left];
int low = left;
int high = right;
while(low < high){
while(low < high && arr[high] > key){
high--;
}
arr[low] = arr[high];
while(low < high && arr[low] < key){
low++;
}
arr[high] = arr[low];
}
arr[low] = key;
quicksort(left,low-1);
quicksort(low+1,right);
}
}
快速排序
最新推荐文章于 2023-07-12 10:59:32 发布