private void QuickSort(int[] arr,int low,int high){
        //递归出口
        if(low>high) return;
        //tempt基准
        int tempt = arr[low];
        int i,j,t;
        i = low;
        j = high;

        while (i < j){
            while (i<j && arr[j]>=tempt) j--;
            while (i<j && arr[i]<=tempt) i++;
            //将大于基准的i和小于基准的j交换
            if (i<j) {
                t = arr[i];
                arr[i] = arr[j];
                arr[j] = t;
            }
        }
        //将数组中的基准调换成i、j相等时的元素
        t = arr[low];
        arr[low] = arr[i];
        arr[i] = t;
        QuickSort(arr,low,i-1);
        QuickSort(arr,i+1,high);
    }

    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]);
        }