插入排序-希尔排序

 public static void main(String[] args) {
    int[] arr = new int[]{2, 5, 3, 7, 1, 8, 3, 9, 0};
    System.out.println(Arrays.toString(arr));
    Main.Hill(arr);
    System.out.println(Arrays.toString(arr));
}

private static void Hill(int[] arr) {
    int k = 1;
    //遍历所有步长
    for (int d = arr.length / 2; d > 0; d /= 2) {
        //遍历所有元素
        for (int i = d; i < arr.length; i++) {
            //遍历本组的所有元素
            for (int j = i - d; j >= 0; j -= d) {
                if (arr[j] > arr[j + d]) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }
        System.out.println("第"+k+"次："+Arrays.toString(arr));
        k++;
    }
}