【go】插入排序

在学习go的过程中，正好在看《算法导论》，于是实现了一下插入排序：
package main

import (
	"fmt"
	"rand"
	"time"
)

func main() {
	arr := Random(10)
	array := Copy(arr)
	result := Sort(array)
	fmt.Println("arr:\t", arr)
	fmt.Println("result:\t", result)
}

func Sort(arr []int32) []int32 {
	length := len(arr)
	for i := 1; i < length; i++ {
		key := arr[i]
		var j int
		for j = i - 1; j >=0 && arr[j] > key; j-- {
			arr[j+1] = arr[j]
		}
		arr[j+1] = key
	}
	return arr
}

func Copy(src []int32)[] int32{
	length := len(src)
	dest := make([]int32, length)
	for i := 0; i < length; i++ {
		dest[i] = src[i]
	}
	return dest
}

func Random(length int32) []int32{
	result := make([]int32, length)
	var i int32 = 0
	for i = 0; i < length; i++ {
		rand.Seed(time.Nanoseconds())
		result[i] = rand.Int31n(100)
	}
	return result
}

有疑问加站长微信联系（非本文作者）