算法练习3：希尔排序(java)

1.选择间隔，选n/2的间隔，n是length

2.组内排序

3.缩小间隔直至2,重复以上步骤

间隔1时候插入排序

import java.util.Arrays;

public class Test3 {
    public static void main(String[] args) {
        int[] arr = {3, 5, 25, 78, 1, 7, 352, 5676, 8, 1};
        System.out.println(Arrays.toString(arr));
        int n = arr.length / 2;
        while (n > 0) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < arr.length; j = j + n) {
                    //内层是插入排序
                    int temp = arr[j];
                    int k = j - n;
                    for (; k >= 0; k = k - n) {//注意这边0没有拍进去,k是可以=0的
                        if (arr[k] < temp) {
                            break;
                        } else {
                            arr[k + n] = arr[k];
                        }
                    }
                    arr[k + n] = temp;

                }
            }
            n = n / 2;
        }
        System.out.println(Arrays.toString(arr));
    }

}