Java实现模板化归并排序

Java实现模板化归并排序

import java.util.Comparator;

public class MergeSort {
    public static <T extends Comparable<T>> void mergeSort(T arr[], int n){
        long startTime = System.currentTimeMillis();
        __mergeSort(arr, 0, n-1);
        long finalTime = System.currentTimeMillis();
        System.out.println("Merge Sort time is: "+(finalTime-startTime));
    }
//使用递归排序，对arr[l,...r]范围内进行排序
    private static<T extends Comparable<T>> void __mergeSort(T arr[], int l, int r) {
        if(l>=r){
            return;
        }
        int mid = (l+r)/2;
        __mergeSort(arr, l, mid);
        __mergeSort(arr, mid+1, r);
        __merge(arr, l, mid, r, new MyComparator<T>());
    }
//归并arr[l,...mid] 与 arr[mid+1,...r]
    private static<T> void __merge(T arr[], int l, int mid, int r, Comparator<? super T> comparator) {
        T aux[] = (T[]) new Object[r-l+1];
        for(int i=l; i<=r; i++){
            aux[i-l] = arr[i];
        }
        int i=l, j=mid+1;
        for(int k=l; k<=r; k++){
            if(i>mid){
                arr[k] = aux[j-l];
                j++;
            }else if(j>r){
                arr[k] = aux[i-l];
                i++;
            }
            else if(comparator.compare(aux[i-l], aux[j-l])<0){
                arr[k] = aux[i-l];
                i++;
            }
            else{
                arr[k] = aux[j-l];
                j++;
            }
        }

    }
}
class MyComparator<T extends Comparable<T>> implements Comparator<T>{

    @Override
    public int compare(T o1, T o2) {
        return o1.compareTo(o2);
    }
}

难点及解决办法

1. new T[] 使用 (T[]) new Object[] 代替
2. 在归并时传入比较器Comparator