排序算发-快速排序

public class Quick {

    public static void main(String[] args) {
        //Comparable[] a = {'E', 'E', 'G', 'M', 'R', 'A', 'C', 'E', 'R', 'T'};
        Comparable[] a = {49,38,65,97,76,13,27,49};
        sort(a);
        for (Comparable i : a) {
            System.out.print(i + " ");
        }
    }

    public static void sort(Comparable[] a) {
        sort(a, 0, a.length - 1);
    }

    private static void sort(Comparable[] a, int lo, int hi) {
        if (hi <= lo) return;
        int j = partition(a, lo, hi);
        sort(a, lo, j - 1);
        sort(a, j + 1, hi);
    }

    public static boolean less(Comparable v, Comparable w) {
        return v.compareTo(w) < 0;
    }

    public static void exch(Comparable[] a, int i, int j) {
        Comparable t = a[i];
        a[i] = a[j];
        a[j] = t;
    }

    private static void show(Comparable[] a){
        for (Comparable i : a) {
            System.out.print(i+ " ");
        }
        System.out.println();
    }
    private static int partition(Comparable[] a, int lo, int hi) {
        int i = lo, j = hi + 1;
        Comparable v = a[lo];
        while (true) {
            show(a);
            while (less(a[++i], v))
                if (i == hi) break;
            while (less(v, a[--j]))
                if (j == lo) break;
            if (i >= j) break;
            exch(a, i, j);
        }
        exch(a, lo, j);
        return j;
    }
}