forked from MichalxPZ/AiSD
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sortTest.py
118 lines (103 loc) · 4.49 KB
/
sortTest.py
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
import unittest
import sorts
from random import randint
class MyTestCase(unittest.TestCase):
def testRandom1(self):
tabLenght = randint(1, 1000)
tab = [0] * tabLenght
for i in range(tabLenght):
tab[i] = randint(0, 1000)
tabSort = sorted(tab)
self.assertEqual(sorts.selectionSort(tab), tabSort)
self.assertEqual(sorts.insertionSort(tab), tabSort)
self.assertEqual(sorts.bubbleSort(tab), tabSort)
self.assertEqual(sorts.quickSort(tab), tabSort)
self.assertEqual(sorts.mergeSort(tab), tabSort)
self.assertEqual(sorts.heapSort(tab), tabSort)
self.assertEqual(sorts.countingSort(tab), tabSort)
def testRandom2(self):
tabLenght = randint(1, 500)
tab = [0] * tabLenght
for i in range(tabLenght):
tab[i] = randint(0, 1000)
tabSort = sorted(tab)
self.assertEqual(sorts.selectionSort(tab), tabSort)
self.assertEqual(sorts.insertionSort(tab), tabSort)
self.assertEqual(sorts.bubbleSort(tab), tabSort)
self.assertEqual(sorts.quickSort(tab), tabSort)
self.assertEqual(sorts.mergeSort(tab), tabSort)
self.assertEqual(sorts.heapSort(tab), tabSort)
self.assertEqual(sorts.countingSort(tab), tabSort)
def testRandom3(self):
tabLenght = randint(1, 10000)
tab = [0] * tabLenght
for i in range(tabLenght):
tab[i] = randint(0, 200)
tabSort = sorted(tab)
self.assertEqual(sorts.selectionSort(tab), tabSort)
self.assertEqual(sorts.insertionSort(tab), tabSort)
self.assertEqual(sorts.bubbleSort(tab), tabSort)
self.assertEqual(sorts.quickSort(tab), tabSort)
self.assertEqual(sorts.mergeSort(tab), tabSort)
self.assertEqual(sorts.heapSort(tab), tabSort)
self.assertEqual(sorts.countingSort(tab), tabSort)
def testConstValue(self):
tabLenght = randint(1, 1000)
tab = [0] * tabLenght
const_val = randint(1, 5)
for i in range(tabLenght):
tab[i] = const_val
tabSort = sorted(tab)
self.assertEqual(sorts.selectionSort(tab), tabSort)
self.assertEqual(sorts.insertionSort(tab), tabSort)
self.assertEqual(sorts.bubbleSort(tab), tabSort)
self.assertEqual(sorts.quickSort(tab), tabSort)
self.assertEqual(sorts.mergeSort(tab), tabSort)
self.assertEqual(sorts.heapSort(tab), tabSort)
self.assertEqual(sorts.countingSort(tab), tabSort)
def testAscendingOrder(self):
tabLenght = randint(1, 10000)
tab = [0] * tabLenght
for i in range(tabLenght):
tab[i] = randint(0, 200)
tab = sorted(tab, reverse=True)
tabSort = sorted(tab)
self.assertEqual(sorts.selectionSort(tab), tabSort)
self.assertEqual(sorts.insertionSort(tab), tabSort)
self.assertEqual(sorts.bubbleSort(tab), tabSort)
self.assertEqual(sorts.quickSort(tab), tabSort)
self.assertEqual(sorts.mergeSort(tab), tabSort)
self.assertEqual(sorts.heapSort(tab), tabSort)
self.assertEqual(sorts.countingSort(tab), tabSort)
def testDescendingOrder(self):
tabLenght = randint(1, 10000)
tab = [0] * tabLenght
for i in range(tabLenght):
tab[i] = randint(0, 200)
tab = sorted(tab)
tabSort = sorted(tab)
self.assertEqual(sorts.selectionSort(tab), tabSort)
self.assertEqual(sorts.insertionSort(tab), tabSort)
self.assertEqual(sorts.bubbleSort(tab), tabSort)
self.assertEqual(sorts.quickSort(tab), tabSort)
self.assertEqual(sorts.mergeSort(tab), tabSort)
self.assertEqual(sorts.heapSort(tab), tabSort)
self.assertEqual(sorts.countingSort(tab), tabSort)
def testPyramid(self):
tabLenght = randint(1, 10000)
tab = [0] * tabLenght
for i in range(tabLenght):
tab[i] = randint(0, 200)
half1 = sorted(tab[0:len(tab)//2])
half2 = sorted(tab[(len(tab)//2) + 1 ::], reverse=True)
tab = half1 + half2
tabSort = sorted(tab)
self.assertEqual(sorts.selectionSort(tab), tabSort)
self.assertEqual(sorts.insertionSort(tab), tabSort)
self.assertEqual(sorts.bubbleSort(tab), tabSort)
self.assertEqual(sorts.quickSort(tab), tabSort)
self.assertEqual(sorts.mergeSort(tab), tabSort)
self.assertEqual(sorts.heapSort(tab), tabSort)
self.assertEqual(sorts.countingSort(tab), tabSort)
if __name__ == '__main__':
unittest.main()