快速排序

 1 package main
 2 
 3 import "fmt"
 4 
 5 func quicklySort(s []int) []int {
 6     quickylySortImpl(s, 0, len(s)-1)
 7     return s
 8 }
 9 
10 func quickylySortImpl(s []int, p, r int) {
11     if p >= r {
12         return
13     }
14     q := partition(s, p, r)
15     quickylySortImpl(s, p, q-1)
16     quickylySortImpl(s, q+1, r)
17 }
18 
19 func partition(s []int, p, r int) int {
20     pivot := s[r]
21     i := p
22     for j := p; j <= r; j++ {
23         if s[j] < pivot {
24             s[i], s[j] = s[j], s[i]
25             i = i + 1
26         }
27     }
28     s[i], s[r] = s[r], s[i]
29     return i
30 }
31 
32 func main() {
33     fmt.Println(quicklySort([]int{8, 10, 2, 3, 6, 1, 5}))
34 }