快排Java实现

public static void main(String[] args) {
    int[] arr = {23, 45, 17, 11, 13, 89, 72, 26, 3, 17, 11, 13};
    quickSort(arr, 0, arr.length -1);
    System.out.println(arr);

}

public static void quickSort(int[] arr, int begin, int end) {
    if (begin < end) {
        int temp = arr[begin];
        int i = begin;
        int j = end;
        while (begin < end){
            while (begin < end && arr[end] > temp) {
                end--;
            }
            arr[begin] = arr[end];

            while (begin < end && arr[begin] <= temp) {
                begin++;
            }
            arr[end] = arr[begin];
        }
        arr[begin] = temp;
        quickSort(arr, i, begin - 1);
        quickSort(arr, begin + 1, j);
    }else {
        return;
    }
}