public static void main(String[] args){
int[] arr = {10,7,2,4,7,62,3,4,2,1,8,9,19};
quickSort(arr, 0, arr.length-1);
for (int i = 0; i < arr.length; i++) {
System.out.println(arr[i]);
}
}
public void quickSort(int[] nums,int low,int high){
if(low >= high){
return;
}
int i = low;
int j = high;
// 基准位
int star = nums[low];
// swap使用的临时位
int temp;
while(i<j){
//先看右边,依次往左递减
while(j>i && nums[j] >= star){
j--;
}
//再看左边,依次往右递增
while(i < j && nums[i] <= star){
i++;
}
//如果满足条件则交换
if(i < j){
temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}
//最后将基准位与i和j相等位置的数字交换,这样就给基准位的数字找到了正确的位置
nums[low] = nums[i];
nums[i] = star;
//递归调用左半数组
quickSort(nums,low,i-1);
//递归调用右半数组
quickSort(nums,i+1,high);
}