Eight sorts --------- quick sort

  Find the benchmark number From left to right Set up two cursors each On the left If it is smaller than the reference number, the one on the right is larger than the reference number, then go inward , On the contrary, exchange the values pointed by the left and right cursors , When the left and right cursors meet Exchange the position of cursor and reference number Then take the benchmark number as the boundary Divide into two and continue to calculate

public static void main(String[] args) {
        int [] arr = {7,6,5,4,2,1,3};
        
        quickSort(arr,0, 6);
        System.out.println(Arrays.toString(arr));
    }
 
    public static void quickSort(int[]arr,int left ,int right) {
        
        if(left>right) {
            return;
        }
        int base = arr[left];
        int i = left;
        int j = right;
        while(i!=j) {
            while(arr[j]>=base && i<j) {
                j--;
            }
            while(arr[i]<=base && i<j) {
                i++;
            }
            int temp = arr[i];
            arr[i] = arr[j];
            arr[j] = temp;
        }
        arr[left] = arr[i];
        arr[i] =base ;
        quickSort(arr, 0, i-1);
        quickSort(arr, i+1, right);
    }