/
quick.go
75 lines (72 loc) · 1.21 KB
/
quick.go
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
73
74
75
package algorithm
import (
"time"
"github.com/hajimehoshi/ebiten/v2"
"github.com/hajimehoshi/ebiten/v2/inpututil"
)
func Quick(arr []int, delay time.Duration) {
var pex func(int, int)
pex = func(lower, upper int) {
for {
if inpututil.IsKeyJustPressed(ebiten.KeySpace) {
break
}
time.Sleep(delay)
switch upper - lower {
case -1, 0:
return
case 1:
if arr[upper] < arr[lower] {
arr[upper], arr[lower] = arr[lower], arr[upper]
}
return
}
bx := (upper + lower) / 2
b := arr[bx]
lp := lower
up := upper
outer:
for {
if inpututil.IsKeyJustPressed(ebiten.KeySpace) {
break
}
time.Sleep(delay)
for lp < upper && !(b < arr[lp]) {
lp++
}
for {
if lp > up {
break outer
}
if arr[up] < b {
break
}
up--
}
arr[lp], arr[up] = arr[up], arr[lp]
lp++
up--
}
if bx < lp {
if bx < lp-1 {
arr[bx], arr[lp-1] = arr[lp-1], b
}
up = lp - 2
} else {
if bx > lp {
arr[bx], arr[lp] = arr[lp], b
}
up = lp - 1
lp++
}
if up-lower < upper-lp {
pex(lower, up)
lower = lp
} else {
pex(lp, upper)
upper = up
}
}
}
pex(0, len(arr)-1)
}