-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patheasy_test.go
51 lines (43 loc) · 924 Bytes
/
easy_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
package gosort_test
import (
"math/rand"
"sort"
"testing"
"github.com/sevagh/go-sort"
)
func TestTimSort1Easy(t *testing.T) {
easyArr := make([]int, 400)
for j := 50; j < 100; j++ {
easyArr[j] = rand.Int()
}
for j := 130; j < 200; j++ {
easyArr[j] = 1000 - rand.Int()
}
for j := 320; j < 400; j++ {
easyArr[j] = rand.Int() / rand.Int()
}
gosort.TimSort1(easyArr)
if !sort.IntsAreSorted(easyArr) {
t.Fatalf("timsort didn't work")
} else {
t.Logf("test concluded successfuly")
}
}
func TestTimSort2Easy(t *testing.T) {
easyArr := make([]int, 400)
for j := 50; j < 100; j++ {
easyArr[j] = rand.Int()
}
for j := 130; j < 200; j++ {
easyArr[j] = 1000 - rand.Int()
}
for j := 320; j < 400; j++ {
easyArr[j] = rand.Int() / rand.Int()
}
gosort.TimSort2(easyArr)
if !sort.IntsAreSorted(easyArr) {
t.Fatalf("timsort didn't work")
} else {
t.Logf("test concluded successfuly")
}
}