1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77

import java.util.Arrays;







public class ShellSort {

    public static void main(String[] args) {
        int[] arr = {49, 38, 65, 97, 76, 13, 27, 49, 55, 4};
        System.out.println("排序前:"+Arrays.toString(arr));

        int[] a = Arrays.copyOf(arr,arr.length);
        shellsort1(a);

        int[] b = Arrays.copyOf(arr,arr.length);

        shellsort2(arr);


    }

    








    private static void shellsort2(int[] arr) {
        int gap = 1, i, j, len = arr.length;
        int temp;
        while (gap < len / 3){
            
            gap = gap * 3 + 1;      
        }
        for (; gap > 0; gap /= 3) {
            for (i = gap; i < len; i++) {
                temp = arr[i];
                for (j = i - gap; j >= 0 && arr[j] > temp; j -= gap){
                    arr[j + gap] = arr[j];
                }
                arr[j + gap] = temp;
            }
        }

        System.out.println("排序后:"+Arrays.toString(arr));
    }


    



    private static void shellsort1(int[] arr) {
        
        for (int g = arr.length / 2; g > 0; g /= 2) {
            for (int i = g; i < arr.length; i++) {
                
                int inserted = arr[i];
                int j;
                
                for (j = i - g; j >= 0 && inserted < arr[j]; j -= g) {
                    
                    arr[j + g] = arr[j];
                }
                arr[j + g] = inserted;
            }
        }
        System.out.println("排序后:"+Arrays.toString(arr));
    }
}