图解Java经典算法希尔排序的原理与实现

public class ShellSort {
    public static void main(String[] args){
        int[] array = {86,11,54,34,53,12,45,81,19,65};
        int gap = array.length;
        while (true) {
            gap /= 2;   //增量每次减半
            for (int i = 0; i < gap; i++) {
                for (int j = i + gap; j < array.length; j += gap) {//这个循环里其实就是一个插入排序
                    int k = j - gap;
                    while (k >= 0 && array[k] > array[k+gap]) {
                        int temp = array[k];
                        array[k] = array[k+gap];
                        array[k + gap] = temp;
                        k -= gap;
                    }
                }
            }
            if (gap == 1)
                break;
        }
        System.out.println("排序结果：");
        for(int i=0;i<array.length;i++){
            System.out.print(array[i]+" ");
        }
    }
}
//排序前：{86,11,54,34,53,12,45,81,19,65}
//排序后：{11,12,19,34,45,53,54,65,81,86}