三向切分的快速排序----------对于存在大量重复元素的数组，比标准快速排序效率更高

public class Quick3way {
    public static void sort(Comparable []a , int lo , int hi){
        if (lo>=hi) return;
        int lt = lo; int i = lo+1; int gt = hi;
        Comparable t = a[lo];
        while (i <= gt){
            int cmp = a[i].compareTo(t);
            if (cmp < 0){exch(a,i++,lt++);}
            else if (cmp > 0){exch(a,i,gt--);}
            else {i++;}
        }
        sort(a,lo,lt-1);
        sort(a,gt+1,hi);
    }

    public static void exch(Comparable[] a, int i, int j) {
        Comparable t = a[i];
        a[i] = a[j];
        a[j] = t;
    }
    public static void sort(Comparable[] a) {
        sort(a,0,a.length-1);
    }
    public static void show(Comparable []a){
        for (int i = 0; i < a.length; i++) {
            System.out.print(a[i]+" ");
        }
        System.out.println();
    }
    public static void main(String[] args) {
        String[] a = {"R","B","W","W","R","W","B","R","R","W","B","R"};
        show(a);
        sort(a);
        show(a);
    }
}

 

基本原理：

将数组中的每一个数与a[0]相比较，a[0]一开始就为固定值，此处为字符R。若a[1]<R,则交换两者且lt与i索引均+1,若a[1]>R，则将a[1]直接放在数组最后且索引值gt-1,若a[1]与R相等，则将索引i+1，以此类推。