排序~快排算法

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

class Solution{
    
    public static void main(String[] args) {
            int arr[]=new int[]{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.printf(arr[i]+" ");
            }
    }

    private static void quickSort(int[] arr, int i, int i1) {
        if(i>=i1){
            return;
        }
        int temp=arr[i];
        int low=i;
        int high=i1;
        while (low<high){

            while (low<high && arr[high]>=temp){ //注意这里要大于等于，不然low不会往下走
                high--;
            }
            while (low<high && arr[low]<=temp){
                low++;
            }
            if (low<high){
                int t=arr[low];
                arr[low]=arr[high];
                arr[high]=t;
            }
        }
        //交换基准物
        arr[i]=arr[low];
        arr[low]=temp;

        quickSort(arr,i,low-1);
        quickSort(arr,low+1,i1);



    }


}