重温几种排序算法之希尔排序、归并排序、快速排序

自身复习，就不温习冒泡排序、插入排序了

快速排序：

private static void quickSort(int[] data, int leftIndex, int rightIndex) {
        int pvoit = data[((leftIndex + rightIndex) >> 1)];
        int i = leftIndex;
        int j = rightIndex;
        while (i <= j) {
            while (data[i] < pvoit)
                i++;
            while (data[j] > pvoit)
                j--;
            if (i <= j) {
                int temp = data[i];
                data[i] = data[j];
                data[j] = temp;
                i++;
                j--;
            }
        }
        if (j >= leftIndex)
            quickSort(data, leftIndex, j);
        if (i <= rightIndex)
            quickSort(data, i, rightIndex);
    }

来测试一下：

private static int[] target = new int[] {12,45,458,90,87,5789,23,45,789,13,897,33456,405,768,907,876,90,100,78,333,597,980};

    public static void main(String[] args) {
        quickSort(target, 0, target.length - 1);
        for (Integer s : target) {
            System.err.print(s + " ");
        }
    }

运行结果:

12 13 23 45 45 78 87 90 90 100 333 405 458 597 768 789 876 897 907 980 5789 33456