-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsort_test.go
67 lines (60 loc) · 1.35 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
package genericgokit
import (
"fmt"
"testing"
)
func TestRandomSort(t *testing.T) {
var a = []int{5, 3, 8, 4, 2, 7, 1, 6}
fmt.Printf("old : %v\n", a)
RandomSort(a)
fmt.Printf("new : %v\n", a)
}
func TestBubbleSort(t *testing.T) {
var a = []int{5, 3, 8, 4, 2, 7, 1, 6}
fmt.Printf("old : %v\n", a)
BubbleSort(a, func(i, j int) bool {
return i > j
})
fmt.Printf("new : %v\n", a)
}
func TestSelectSort(t *testing.T) {
var a = []int{5, 3, 8, 4, 2, 7, 1, 6}
fmt.Printf("old : %v\n", a)
SelectSort(a, func(i, j int) bool {
return i > j
})
fmt.Printf("new : %v\n", a)
}
func TestInsertSort(t *testing.T) {
var a = []int{5, 3, 8, 4, 2, 7, 1, 6}
fmt.Printf("old : %v\n", a)
InsertSort(a, func(i, j int) bool {
return i > j
})
fmt.Printf("new : %v\n", a)
}
func TestQuickSort(t *testing.T) {
var a = []int{5, 3, 8, 4, 2, 7, 1, 6}
fmt.Printf("old : %v\n", a)
QuickSort(a, func(i, j int) bool {
return i > j
})
fmt.Printf("new : %v\n", a)
}
//func TestMergeSort(t *testing.T) {
// var a = []int{5, 3, 8, 4, 2, 7, 1, 6}
// fmt.Printf("old : %v\n", a)
// MergeSort(a, func(i, j int) bool {
// return i > j
// })
// fmt.Printf("new : %v\n", a)
//}
//
//func TestHeapSort(t *testing.T) {
// var a = []int{5, 3, 8, 4, 2, 7, 1, 6}
// fmt.Printf("old : %v\n", a)
// HeapSort(a, func(i, j int) bool {
// return i > j
// })
// fmt.Printf("new : %v\n", a)
//}