數據結構-希爾排序

java實現希爾排序算法

源代碼

public class ShellSort extends DataCrol {
    @Override
    public void sort(int[] array) {
        int h = 0;
        int size = array.length;
        while (h <= size) {// 生成初始增量
            h = 3 * h + 1;
        }
//        h = size / 2;
        while (h > 0) {
            for (int i = h; i < size; i++) {
                int j = i - h;
                int get = array[i];
                while (j >= 0 && array[j] > get) {
                    array[j + h] = array[j];
                    j = j - h;
                }
                array[j + h] = get;
            }
            h = (h - 1) / 3;// 遞減增量
//            h /= 2;
        }
    }

    public static void main(String[] args) {
        ShellSort insertionSort = new ShellSort();
        int[] array = DataCrol.createRandomArray(20);
        DataCrol.print(array);
        insertionSort.sort(array);
        DataCrol.print(array);
        insertionSort.timeTest(10000000);
    }
}