-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquick_sort.go
More file actions
72 lines (58 loc) · 857 Bytes
/
Copy pathquick_sort.go
File metadata and controls
72 lines (58 loc) · 857 Bytes
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
package sorting
func QuickSort(arr []int, l int, r int) {
if l >= r {
return
}
p := partition2(arr, l, r)
QuickSort(arr, l, p-1)
QuickSort(arr, p+1, r)
}
func partition(arr []int, l int, r int) int {
i := l
j := l
for ; i < r; i++ {
if arr[i] < arr[r] {
tmp := arr[i]
arr[i] = arr[j]
arr[j] = tmp
j++
}
}
tmp := arr[r]
arr[r] = arr[j]
arr[j] = tmp
return j
}
func partition2(arr []int, l int, r int) int {
mid := (l + r) / 2
i := l
j := r
for i < j {
for ; i <= j; i++ {
if arr[i] >= arr[mid] {
break
}
}
for ; j > i; j-- {
if arr[j] < arr[mid] {
break
}
}
if i <= j {
tmp := arr[i]
arr[i] = arr[j]
arr[j] = tmp
if i == mid {
mid = j
} else if j == mid {
mid = i
}
} else {
i--
}
}
tmp := arr[i]
arr[i] = arr[mid]
arr[mid] = tmp
return i
}