插入排序算法

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

package main

import (
	"fmt"
	"time"
	"math/rand"
)


func sort(arr [10]int) [10]int {
	var temp int
	length := len(arr)
	i := 1

	for i < length {
		j := i - 1
		temp = arr[i]
		for j > -1 && arr[j] > temp {
			arr[j+1] = arr[j]
			j--
		}
		arr[j+1] = temp
		i++
	}

	return arr
}


func main() {
	var arr [10]int
	var temp, i int

	i = 0
	temp = len(arr)

	for i < temp {
		rand.Seed(time.Now().UTC().UnixNano())
		arr[i] = rand.Intn(100)
		i ++
	}

	fmt.Println("data: ", arr)
	arr = sort(arr)
	fmt.Println("sorted data: ", arr)


}