希尔排序详细解说

public static void shellsertSort(int[] array){
        int gap = array.length/2;
        while (gap > 1){
            insertGap(array,gap);
            gap = gap / 2;
        }
        insertGap(array,gap);
    }

    private static void insertGap(int[] array, int gap) {
        for (int bound = gap; bound < array.length; bound++){
            int v = array[bound];
            int cur = bound - gap;//已排好序列的最后一个元素
            for (; cur >= 0; cur -= gap){
                //循环和前面已排好序的元素一次比较
                if (array[cur] < v){
                    array[cur + gap] = array[cur];
                }else {
                    break;
                }
            }
            array[cur + gap] = v;
        }
    }