思路:
通过传入待排序的数组和该数组的前后边界的索引值,结合左右两个指针来不断移动将该数组进行大概从小到大的排序,再左右不断递归来完成排序
代码:
public class Test06 {
public static void main(String[] args) {
int[] arr = {151,125,213,1,252,36,0};
quickSort(arr, 0,arr.length-1 );
System.out.println(Arrays.toString(arr));
}
public static void quickSort(int[] arr,int left,int right){
if(right >= left){
int l = left;
int r = right;
int basic = arr[left];
while(l<r) {
while (l < r && arr[r] > basic) {
r--;
}
if (l < r) {
arr[l] = arr[r];
l++;
}
while (l < r && arr[l] < basic) {
l++;
}
if (l < r) {
arr[r] = arr[l];
r--;
}
}
arr[l] = basic;
quickSort(arr, left , l-1);
quickSort(arr, l+1, right);
}
}
}