java实现快速排序

public static void main(String[] args) {
    int[] arr = {0,2,1,5,3,4,8,9,7,6,10};
    quickSort(0,arr.length - 1,arr);
    for (int i : arr) {
        System.out.print(i + " ");
    }
}

private static void quickSort(int left, int right, int[] arr) {
    if (left >= right) {
        return;
    }
    int i = left;
    int j = right;
    int base = arr[left];
    while (i < j) {
        while (i<j && arr[j] >= base) {
            j--;
        }
        while (i<j && arr[i] <= base) {
            i++;
        }
        if (i < j) {
            int t = arr[i];
            arr[i] = arr[j];
            arr[j] = t;
        }
    }
    arr[left] = arr[i];
    arr[i] = base;
    quickSort(left,i - 1, arr);
    quickSort(i + 1,right, arr);
}