Golang实现冒泡排序

冒泡排序辅助记忆图

 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

package main

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

func timeCost() func() {
	start := time.Now()
	return func() {
		// 纳秒
		println("time cost ", time.Since(start))
	}
}

func testBuble(arr []int) []int {
	defer timeCost()()

	return bubble(arr)
}

func main() {
	source := rand.Perm(1000)
	fmt.Println(source)
	fmt.Println(testBuble(source))
	return
}

func bubble(arr []int) []int {
	l := len(arr)
	for i := 0; i < l; i++ {
		for j := 0; j < l-i-1; j++ {
			if arr[j] > arr[j+1] {
				arr[j], arr[j+1] = arr[j+1], arr[j]
			}
		}
	}
	return arr
}


updatedupdated2021-02-232021-02-23