快速排序模板

快速排序模板

 void qSort(int[] arr, int left, int right) {
        if(left >= right) {
            return ;
        }
        while(left < right) {
            int i = left, j = right, tmp = 0, partion = arr[left];
            while(i < j) {
                while(i < j && arr[j] >= partion) {
                    j--;
                }
                arr[i] = arr[j];
                while(i < j && arr[i] <= partion) {
                    i++;
                }
                arr[j] = arr[i];
            }
            arr[i] = partion;
            qSort(arr, left, i - 1); // 优化递归操作 尾递归优化
            left = i + 1;
        }
    }




``