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
44
45
46
47
48
49
50
51
package main

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

func kuai(arr []int, l, r int) {
	if l >= r {
		return
	}

	i := l
	j := r
	base := arr[j]
	for i < j {
		for ; arr[j] >= base && i < j; j-- {
		}
		for ; arr[i] <= base && i < j; i++ {
		}

		arr[i], arr[j] = arr[j], arr[i]
	}
	// 将基准与边界交换
	arr[r], arr[i+1] = arr[i+1], arr[r]
	kuai(arr, l, i)
	kuai(arr, i+1, r)

}

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

func testKuai(arr []int) []int {
	defer timeCost()()
	kuai(arr, 0, len(arr)-1)
	return arr
}

func main() {
	source := rand.Perm(1000)
	fmt.Println(source)
	fmt.Println(testKuai(source))
	return
}
updatedupdated2021-03-162021-03-16