数据结构之希尔排序

不管你喜不喜欢,我都要献上希尔排序,嘻嘻嘻~~

public class Shell{
    public static void sort(Comparable[] a){
        int h = 1;
        while(h < a.length/2){
            h = 2 * h + 1;
        }
        while(h > 0){
            for(int i = h; i < a.length; i++){
                for(int j = i; j >= h; j -= h){
                    if(greater(a[j-h], a[j])){
                        exch(a, j-h, j);
                    }else{
                        break;
                    }
                }
            }
            h = h/2;
        }
    }
    private static boolean greater(Comparable v, Comparable w){
        return v.compareTo(w) > 0;
    }
    
    private static void exch(Comparable[] a, int i, int j){
        Comparable temp;
        temp = a[i];
        a[i] = a[j];
        a[j] = temp;
    }
}