快速排序代码

 public static void quickSort(int[] arr, int left, int right) {
        if (left > right) {
            return;
        }
        int tem = arr[left];
        int i = left;
        int j = right;
        while (i != j) {
            while (arr[j] >= tem && j > i) {
                j--;
            }
            while (arr[i] <= tem && j > i) {
                i++;
            } //注意这两段while死循环的顺序，要把最后的i=j指针指到小于temp的数据上去
            if (j > i) {
                int t = arr[i];
                arr[i] = arr[j];
                arr[j] = t;
            }
        }
        arr[left] = arr[i];
        arr[i] = tem;
        quickSort(arr, left, i - 1);
        quickSort(arr, i + 1, right);
    }