直接插入排序(go实现)
package main import "fmt" func main() { arr := []int{11, 2, 7, 11, 88, 91, 23, 14, 12, 33} straightInsertSort(arr) for i :=0 ; i < len(arr); i++ { fmt.Println(arr[i]) } } func straightInsertSort(unsorted []int) { for i := 1; i < len(unsorted); i++ { if unsorted[i-1] > unsorted[i] { temp := unsorted[i] var j int for j = i - 1; j >= 0 && unsorted[j] > temp; j-- { unsorted[j+1] = unsorted[j] } unsorted[j+1] = temp } } }
网页题目:直接插入排序(go实现)
文章转载:http://myzitong.com/article/pdiiej.html