排序算法-归并排序

public class Merge {


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

    //归并所需的辅助数组
    private static Comparable[] aux;

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

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

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

    private static void merge(Comparable[] a, int lo, int mid, int hi) {
        int i = lo, j = mid + 1;
        for (int k = lo; k <= hi; k++) {
            aux[k] = a[k];
        }

        for (int k = lo; k <= hi; k++) {
            if (i > mid) a[k] = aux[j++]; //左半边元素用尽 取右半边的元素
            else if (j > hi) a[k] = aux[i++];//右半边元素用尽 取左半边的元素
            else if (less(aux[j], aux[i])) a[k] = aux[j++]; //右半边元素比左半边元素小 取右半边元素
            else a[k] = aux[i++]; //右半边元素比左半边元素大 取左半边元素
        }
    }
}