封裝成函數(shù)：
func ShellSort(a []int) {
n := len(a)
h := 1
for h < n/3 { //尋找合適的間隔h
h = 3*h + 1
}
for h >= 1 {
//將數(shù)組變?yōu)殚g隔h個元素有序
for i := h; i < n; i++ {
//間隔h插入排序
for j := i; j >= h && a[j] < a[j-h]; j -= h {
swap(a, j, j-h)
}
}
h /= 3
}
}
func swap(slice []int, i int, j int) {
slice[i], slice[j] = slice[j], slice[i]
}
測試：
s := []int{9,0,6,5,8,2,1,7,4,3}
fmt.Println(s)
ShellSort(s)
fmt.Println(s)
輸出：
[9 0 6 5 8 2 1 7 4 3]
[0 1 2 3 4 5 6 7 8 9]
