快速排序算法Java

快速排序算法占坑：

    public static void quickSort(int[] arr, int low, int high) {
        if (low < high) {
            int position = partition(arr, low, high);
            quickSort(arr, low, position - 1);
            quickSort(arr, position + 1, high);
        }
    }

    private static int partition(int[] arr, int low, int high) {
        int pivot = arr[low];
        int i = low;
        int j = high;
        while (i < j) {
            while (arr[j] >= pivot && j > i) j--;
            if (i < j && arr[j] < pivot) {
                arr[i] = arr[j];
                i++;
            }
            while (arr[i] < pivot && i < j) i++;
            if (i < j && arr[i] >= pivot) {
                arr[j] = arr[i];
                j--;
            }
        }
        arr[i] = pivot;
        return i;
    }