-
Notifications
You must be signed in to change notification settings - Fork 0
/
run_test.go
86 lines (80 loc) · 1.45 KB
/
run_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
package Hal
import (
"testing"
)
var arrN = 100000
//func BenchmarkBTreeSort(b *testing.B) {
// for n := 0; n < b.N; n ++ {
// A := RandInt(arrN)
// temp.BTreeSort(A)
// }
//}
//
//func BenchmarkRadixSort(b *testing.B) {
// for n := 0; n < b.N; n ++ {
// A := RandInt(arrN)
// temp.RadixSort(A)
// }
//}
func BenchmarkHeapSortASC(b *testing.B) {
for n := 0; n < b.N; n ++ {
A := RandInt(arrN)
HeapSort(A, true)
}
}
//func BenchmarkHeapSortDES(b *testing.B) {
// for n := 0; n < b.N; n ++ {
// A := RandInt(arrN)
// HeapSort(A, false)
// }
//}
//
//func BenchmarkTimSort32(b *testing.B) {
// for n := 0; n < b.N; n ++ {
// A := RandInt(arrN)
// TimSort(A, 32)
// }
//}
//
//func BenchmarkTimSort64(b *testing.B) {
// for n := 0; n < b.N; n ++ {
// A := RandInt(arrN)
// TimSort(A, 64)
// }
//}
//
//func BenchmarkTimSort128(b *testing.B) {
// for n := 0; n < b.N; n ++ {
// A := RandInt(arrN)
// TimSort(A, 128)
// }
//}
//
//
func BenchmarkQuickSort_Hoare(b *testing.B) {
for n := 0; n < b.N; n ++ {
A := RandIntUnique(arrN)
QuickSort(A, "hoare")
}
}
//
//func BenchmarkQuickSort_Lomuto(b *testing.B) {
// for n := 0; n < b.N; n ++ {
// A := RandInt(arrN)
// QuickSort(A, "lomuto")
// }
//}
//
//func BenchmarkQuickSortGolang(b *testing.B) {
// for n := 0; n < b.N; n ++ {
// A := RandInt(arrN)
// sort.Ints(A)
// }
//}
//
//func BenchmarkInsertSort(b *testing.B) {
// for n := 0; n < b.N; n ++ {
// A := RandInt(arrN)
// InsertSort(A)
// }
//}