public static int quickSort(int[] arr, int low, int high) {//返回中间值
int pivot = arr[low];//令中心轴体等于数组的第一个元素
while (low<high){
while (low<high&&arr[high]>=pivot){
high--;
}
arr[low] = arr[high];
while (low<high&&arr[low]<=pivot){
low++;
}
arr[high] = arr[low];
}
arr[low] = pivot;
return low;
}
public static void quicksort2 (int[] arr,int low,int high){
if (low<high){
int poistion =quickSort(arr,low,high);
quicksort2(arr,low,poistion-1);
quicksort2(arr,poistion+1,high);
}
}
简洁的递归快排
最新推荐文章于 2024-08-10 10:05:30 发布