Java 八大排序之——快速排序

代码

    public static int partition(int a[], int low, int high) {        int privotKey = a[low];        while (low < high) {            while (low < high && a[high] >= privotKey) {                high--;            }            common.swap(a, low, high);            while (low < high && a[low] <= privotKey) {                low++;            }            common.swap(a, low, high);        }        common.print(a);        return low;    }    public static void quickSort(int[] a, int low, int high) {        if (low < high) {            int privotLoc = partition(a, low, high);            quickSort(a, low, privotLoc - 1);            quickSort(a, privotLoc + 1, high);        }    }