希尔排序(golang实现)

Tue Sep 5, 2017

200 Words|Read in about 1 Min
Tags: 算法  

封装成函数:

func ShellSort(a []int) {
	n := len(a)
	h := 1
	for h < n/3 { //寻找合适的间隔h
		h = 3*h + 1
	}
	for h >= 1 {
		//将数组变为间隔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]

See Also

Tue Sep 5, 2017

200 Words|Read in about 1 Min
Tags: 算法