题目描述
一种快速排序的实现方式
private static void quickSort(int[] nums, int low, int high) {
int i = low ;
int j = high;
if(low >= high){
return;
}
int key = nums[i];
while(i < j){
while(i < j && nums[j] >= key){
j--;
}
if(j > i){
nums[i++] = nums[j];
}
while(i < j && nums[i] <= key){
i++;
}
if(j > i){
nums[j--] = nums[i];
}
}
nums[i] = key;
quickSort(nums,low,i - 1);
quickSort(nums,i + 1,high);
}
```