折半插入排序——golang实现

go语言实现折半插入排序

func HalfInsertSort(a []int){//折半插入
	var j,low,high int
	for i := 1;i<len(a);i++ {
		a[0] = a[i]
		low = 1
		high = i-1
		for low <= high {   //在a[1:i-1]中折半查找插入的位置
			mid := (low+high)/2
			if a[0] < a[mid] {
				high = mid-1
			}else{
				low = mid +1
			}
		}
		for j = i-1; j>high; j-- {
			a[j+1] = a[j]
		}
		a[j+1] = a[0]
	}
	fmt.Println(a)
}

所谓勇者,是心有所惧,唯自知尔！