快速排序算法

 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"
	"time"
	"math/rand"
)

func sort(list []int) {
	length := len(list)
	if length < 1 {
		return
	}

	index := length / 2
	pivot, i, j := list[index], 0, length - 1
	for i < j {
		for i < index && list[i] <= pivot {
			i ++
		}
		if i < j {
			list[index] = list[i]
			index = i
		}

		for j > index && list[j] > pivot {
			j --
		}
		if i < j {
			list[index] = list[j]
			index = j
		}
	}

	list[i] = pivot
	sort(list[:i])
	sort(list[i + 1:])
}

func main() {
	list := make([]int, 10)

	rand.Seed(time.Now().UTC().UnixNano())
	for i,_ := range list {
		list[i] = rand.Intn(100)
	}

	fmt.Println("data: ", list)
	sort(list)
	fmt.Println("sorted data: ", list)
}