。。。快速排序。。。

public void quickSort(int[] array, int low, int high) {
        if (low >= high) {
            return;
        }
        int left = low;
        int right = high;
        int mid = array[left];
        while (left < right) {
            while (left < right && array[right] >= mid) {
                right--;
            }
            array[left] = array[right];
            while (left < right && array[left] <= mid) {
                left++;
            }
            array[right] = array[left];
        }
        array[left] = mid;
        quickSort(array, low, left - 1);
        quickSort(array, left + 1, high);
    }