~telemachus/algorithms

ref: c43967855e992983b2e500c69dff405396441c7e algorithms/benchmark_quicksort_test.go -rw-r--r-- 3.2 KiB
c4396785Peter Aronoff Update for golangci-lint 10 months ago
                                                                                
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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
package algorithms_test

import (
	"math/rand"
	"sort"
	"testing"

	"git.sr.ht/~telemachus/algorithms"
)

func shuffledSlice() sort.IntSlice {
	var xs sort.IntSlice = make([]int, 10000)
	rand.Shuffle(len(xs), func(i, j int) {
		xs[i], xs[j] = xs[j], xs[i]
	})

	return xs
}

func equalSlice() sort.IntSlice {
	var xs sort.IntSlice = make([]int, 10000)
	for i := 0; i < 10000; i++ {
		xs[i] = 1
	}

	return xs
}

func inOrderSlice() sort.IntSlice {
	var xs sort.IntSlice = make([]int, 10000)
	for i := 0; i < 10000; i++ {
		xs[i] = i
	}

	return xs
}

func reversedSlice() sort.IntSlice {
	var xs sort.IntSlice = make([]int, 10000)
	for i, j := 0, 10000; i < 10000; i, j = i+1, j-1 {
		xs[i] = j
	}

	return xs
}

func BenchmarkLomutoQuicksortShuffledSlice(b *testing.B) {
	xs := shuffledSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortL(xs, 0, len(xs)-1)
	}
}

func BenchmarkHoareQuicksortShuffledSlice(b *testing.B) {
	xs := shuffledSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortH(xs, 0, len(xs)-1)
	}
}

func BenchmarkStdlibSortShuffledSlice(b *testing.B) {
	xs := shuffledSlice()
	b.ResetTimer()

	for i := 0; i < b.N; i++ {
		xs.Sort()
	}
}

func BenchmarkYourBasicQuicksortShuffledSlice(b *testing.B) {
	xs := shuffledSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortYB(xs)
	}
}

func BenchmarkLomutoQuicksortEqualSlice(b *testing.B) {
	xs := equalSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortL(xs, 0, len(xs)-1)
	}
}

func BenchmarkHoareQuicksortEqualSlice(b *testing.B) {
	xs := equalSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortH(xs, 0, len(xs)-1)
	}
}

func BenchmarkStdlibSortEqualSlice(b *testing.B) {
	xs := equalSlice()
	b.ResetTimer()

	for i := 0; i < b.N; i++ {
		xs.Sort()
	}
}

func BenchmarkYourBasicQuicksortEqualSlice(b *testing.B) {
	xs := equalSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortYB(xs)
	}
}

func BenchmarkLomutoQuicksortInOrderSlice(b *testing.B) {
	xs := inOrderSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortL(xs, 0, len(xs)-1)
	}
}

func BenchmarkHoareQuicksortInOrderSlice(b *testing.B) {
	xs := inOrderSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortH(xs, 0, len(xs)-1)
	}
}

func BenchmarkStdlibSortInOrderSlice(b *testing.B) {
	xs := inOrderSlice()
	b.ResetTimer()

	for i := 0; i < b.N; i++ {
		xs.Sort()
	}
}

func BenchmarkYourBasicQuicksortInOrderSlice(b *testing.B) {
	xs := inOrderSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortYB(xs)
	}
}

func BenchmarkLomutoQuicksortReversedSlice(b *testing.B) {
	xs := reversedSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortL(xs, 0, len(xs)-1)
	}
}

func BenchmarkHoareQuicksortReversedSlice(b *testing.B) {
	xs := reversedSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortH(xs, 0, len(xs)-1)
	}
}

func BenchmarkStdlibSortReversedSlice(b *testing.B) {
	xs := reversedSlice()
	b.ResetTimer()

	for i := 0; i < b.N; i++ {
		xs.Sort()
	}
}

func BenchmarkYourBasicQuicksortReversedSlice(b *testing.B) {
	xs := reversedSlice()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		algorithms.QuicksortYB(xs)
	}
}