快速排序

 

public static void sort(int[] array) {
        if ((array == null || array.length == 0)) {
            return;
        }
        quickSort(array, 0, array.length - 1);
    }

    public static void quickSort(int[] array, int left, int right) {
        if (left > right) {
            return;
        }
        int base = array[left];  //标记位
        int i = left, j = right;
        while (i != j) {
            while (i < j && array[j] >= base) {
                j--;
            }
            while (i < j && array[i] <= base) {
                i++;
            }
            if (i < j) {
                int temp = array[i];
                array[i] = array[j];
                array[j] = temp;
            }
        }
        array[left] = array[i];
        array[i] = base;
        quickSort(array, left, i - 1);
        quickSort(array, i + 1, right);
    }