-
Notifications
You must be signed in to change notification settings - Fork 0
/
example_test.go
121 lines (110 loc) · 2.42 KB
/
example_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
package codility_test
import (
"fmt"
. "github.com/zengfenfei/codility"
"testing"
)
func ExampleFish() {
A, B := make([]int, 5), make([]int, 5)
A[0] = 4
A[1] = 3
A[2] = 2
A[3] = 1
A[4] = 5
B[0] = 0
B[1] = 1
B[2] = 0
B[3] = 0
B[4] = 0
fmt.Println(Fish(A, B))
// Output: 2
}
func ExampleNumberOfDiscIntersections() {
A := make([]int, 6)
A[0] = 1
A[1] = 5
A[2] = 2
A[3] = 1
A[4] = 4
A[5] = 0
fmt.Println(NumberOfDiscIntersections(A))
// Output: 11
}
func ExampleTriangle() {
A := []int{10, 2, 5, 1, 8, 20}
fmt.Println(Triangle(A))
// Output: 1
}
func ExampleDistinct() {
var A [6]int
A[0] = 2
A[1] = 1
A[2] = 1
A[3] = 2
A[4] = 3
A[5] = 1
fmt.Println(Distinct(A[:]))
// Output: 3
}
// ExampleMinAvgTwoSlice test and demonstrate MinAvgTwoSlice
func ExampleMinAvgTwoSlice() {
var A [7]int
A[0] = 4
A[1] = 2
A[2] = 2
A[3] = 5
A[4] = 1
A[5] = 5
A[6] = 8
fmt.Println(MinAvgTwoSlice(A[:]))
fmt.Println(MinAvgTwoSlice([]int{10000, -10000}))
// Output:
// 1
// 0
}
func getSortCases() [][]int {
return [][]int{
{6, 5, 3, 1, 8, 7, 2, 4},
{3},
{3, 2},
{3, 2, 9},
}
}
func ExampleInsertSort() {
for _, a := range getSortCases() {
InsertSort(a)
fmt.Println(a)
}
// Output:
// [1 2 3 4 5 6 7 8]
// [3]
// [2 3]
// [2 3 9]
}
func ExampleSelectionSort() {
for _, a := range getSortCases() {
SelectionSort(a)
fmt.Println(a)
}
// Output:
// [1 2 3 4 5 6 7 8]
// [3]
// [2 3]
// [2 3 9]
}
func ExampleMergeSort() {
for _, a := range getSortCases() {
MergeSort(a)
fmt.Println(a)
}
// Output:
// [1 2 3 4 5 6 7 8]
// [3]
// [2 3]
// [2 3 9]
}
func BenchmarkMergeSort(b *testing.B) {
for i := 0; i < b.N; i++ {
MergeSort([]int{6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4, 6, 5, 3, 1, 8, 7, 2, 4})
}
}