快速排序

public static void quickSort01(int[] arr, int low, int high) {
    if (low >= high) {
        return;
    }
    int i = low;
    int j = high;
    int temp = arr[low];
    int t;
    while (i < j) {
        while (temp <= arr[j] && i < j) {
            j--;
        }
        while (temp >= arr[i] && i < j) {
            i++;
        }
        if (i < j) {
            t = arr[j];
            arr[j] = arr[i];
            arr[i] = t;
        }
    }
    arr[low] = arr[i];
    arr[i] = temp;
    quickSort01(arr, low , j - 1);
    quickSort01(arr, j + 1 , high);
    System.out.println("");
}