-
Notifications
You must be signed in to change notification settings - Fork 14
/
Copy pathsort_test.go
160 lines (133 loc) · 2.99 KB
/
sort_test.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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
package collections
import (
"math/rand"
"sort"
"testing"
"github.com/stretchr/testify/assert"
)
var maxCnt int = 10e3
func yieldRandomArray(cnt int) []int {
res := make([]int, cnt)
for i := 0; i < cnt; i++ {
res[i] = rand.Int()
}
return res
}
func assertSort(items []int) bool {
for i := 0; i < len(items)-1; i++ {
if items[i] > items[i+1] {
return false
}
}
return true
}
type StdItems struct {
data []int
}
func (o StdItems) Less(i, j int) bool {
return o.data[i] < o.data[j]
}
func (o StdItems) Swap(i, j int) {
o.data[i], o.data[j] = o.data[j], o.data[i]
}
func (o StdItems) Len() int {
return len(o.data)
}
func TestBubbleSort(t *testing.T) {
items := yieldRandomArray(maxCnt)
BubbleSort(items)
assert.True(t, assertSort(items))
}
func BenchmarkBubbleSort(b *testing.B) {
for i := 0; i < b.N; i++ {
items := yieldRandomArray(maxCnt)
BubbleSort(items)
}
}
func TestInsertionSort(t *testing.T) {
items := yieldRandomArray(maxCnt)
InsertionSort(items)
assert.True(t, assertSort(items))
}
func BenchmarkInsertionSort(b *testing.B) {
for i := 0; i < b.N; i++ {
items := yieldRandomArray(maxCnt)
InsertionSort(items)
}
}
func TestStdSort(t *testing.T) {
items := StdItems{yieldRandomArray(maxCnt)}
sort.Sort(items)
assert.True(t, assertSort(items.data))
}
func BenchmarkStdSort(b *testing.B) {
for i := 0; i < b.N; i++ {
sort.Sort(StdItems{yieldRandomArray(maxCnt)})
}
}
func TestQuickSort(t *testing.T) {
items := yieldRandomArray(maxCnt)
QuickSort(items)
assert.True(t, assertSort(items))
}
func BenchmarkQuickSort(b *testing.B) {
for i := 0; i < b.N; i++ {
items := yieldRandomArray(maxCnt)
QuickSort(items)
}
}
func TestShellSort(t *testing.T) {
items := yieldRandomArray(maxCnt)
ShellSort(items)
assert.True(t, assertSort(items))
}
func BenchmarkShellSort(b *testing.B) {
for i := 0; i < b.N; i++ {
items := yieldRandomArray(maxCnt)
ShellSort(items)
}
}
func TestHeapSort(t *testing.T) {
items := yieldRandomArray(maxCnt)
HeapSort(items)
assert.True(t, assertSort(items))
}
func BenchmarkHeapSort(b *testing.B) {
for i := 0; i < b.N; i++ {
items := yieldRandomArray(maxCnt)
HeapSort(items)
}
}
func TestMergeSort(t *testing.T) {
items := yieldRandomArray(maxCnt)
MergeSort(items)
assert.True(t, assertSort(items))
}
func BenchmarkMergeSort(b *testing.B) {
for i := 0; i < b.N; i++ {
items := yieldRandomArray(maxCnt)
MergeSort(items)
}
}
func TestStdSortWithoutInterface(t *testing.T) {
items := yieldRandomArray(maxCnt)
StdSortWithoutInterface(items)
assert.True(t, assertSort(items))
}
func BenchmarkStdSortWithoutInterface(b *testing.B) {
for i := 0; i < b.N; i++ {
items := yieldRandomArray(maxCnt)
StdSortWithoutInterface(items)
}
}
func TestStdSortWithGoroutine(t *testing.T) {
items := yieldRandomArray(maxCnt)
StdSortWithGoroutine(items)
assert.True(t, assertSort(items))
}
func BenchmarkStdSortWithGoroutine(b *testing.B) {
for i := 0; i < b.N; i++ {
items := yieldRandomArray(maxCnt)
StdSortWithGoroutine(items)
}
}