/**
 * @date : 2019/03/29
 */
public class QuickSort {
    public static void main(String[] args) {
        int[] array = {3, 0, 7, 19, 4, 10, 7, 6, 11};
        quickSort(array, 0, array.length-1);
        for (int item : array) {
            System.out.println(item);
        }
    }
    public static void quickSort(int array[], int start, int end) {
        int i = start;
        int j = end;
        if (start >= array.length)
            return;
        if (end <= 0)
            return;
        int temp = array[start];
        if (start >= end)
            return;
        while (i != j) {
            while (i < j && array[j] >= temp)
                j--;
            if (j > i)
                array[i] = array[j];
            while (i < j && array[i] <= temp)
                i++;
            if (i < j)
                array[j] = array[i];
        }
        array[i] = temp;
        quickSort(array, start, i - 1);
        quickSort(array, i + 1, end);
    }
}