|
1
|
|
|
import unittest |
|
2
|
|
|
|
|
3
|
|
|
from pyalgs.algorithms.commons.sorting import SelectionSort, InsertionSort, ShellSort, MergeSort, QuickSort, \ |
|
4
|
|
|
ThreeWayQuickSort, HeapSort |
|
5
|
|
|
|
|
6
|
|
|
|
|
7
|
|
|
class SelectionSortTest(unittest.TestCase): |
|
8
|
|
|
def test_sort(self): |
|
9
|
|
|
a = [4, 2, 1] |
|
10
|
|
|
SelectionSort.sort(a) |
|
11
|
|
|
self.assertEqual(1, a[0]) |
|
12
|
|
|
self.assertEqual(2, a[1]) |
|
13
|
|
|
self.assertEqual(4, a[2]) |
|
14
|
|
|
|
|
15
|
|
|
|
|
16
|
|
|
class InsertionSortTest(unittest.TestCase): |
|
17
|
|
|
def test_sort(self): |
|
18
|
|
|
a = [4, 2, 1] |
|
19
|
|
|
InsertionSort.sort(a) |
|
20
|
|
|
self.assertEqual(1, a[0]) |
|
21
|
|
|
self.assertEqual(2, a[1]) |
|
22
|
|
|
self.assertEqual(4, a[2]) |
|
23
|
|
|
|
|
24
|
|
|
|
|
25
|
|
|
class ShellSortTest(unittest.TestCase): |
|
26
|
|
|
def test_sort(self): |
|
27
|
|
|
a = [4, 2, 1, 23, 4, 5, 6, 7, 8, 9, 20, 11, 13, 34, 66] |
|
28
|
|
|
ShellSort.sort(a) |
|
29
|
|
|
print(a) |
|
30
|
|
|
self.assertEqual(1, a[0]) |
|
31
|
|
|
self.assertEqual(2, a[1]) |
|
32
|
|
|
self.assertEqual(4, a[2]) |
|
33
|
|
|
|
|
34
|
|
|
|
|
35
|
|
|
class MergeSortTest(unittest.TestCase): |
|
36
|
|
|
def test_sort(self): |
|
37
|
|
|
a = [4, 2, 1, 23, 4, 5, 6, 7, 8, 9, 20, 11, 13, 34, 66] |
|
38
|
|
|
MergeSort.sort(a) |
|
39
|
|
|
print(a) |
|
40
|
|
|
self.assertEqual(1, a[0]) |
|
41
|
|
|
self.assertEqual(2, a[1]) |
|
42
|
|
|
self.assertEqual(4, a[2]) |
|
43
|
|
|
|
|
44
|
|
|
|
|
45
|
|
|
class QuickSortTest(unittest.TestCase): |
|
46
|
|
|
def test_sort(self): |
|
47
|
|
|
a = [4, 2, 1, 23, 4, 5, 6, 7, 8, 9, 20, 11, 13, 34, 66] |
|
48
|
|
|
QuickSort.sort(a) |
|
49
|
|
|
print(a) |
|
50
|
|
|
self.assertEqual(1, a[0]) |
|
51
|
|
|
self.assertEqual(2, a[1]) |
|
52
|
|
|
self.assertEqual(4, a[2]) |
|
53
|
|
|
|
|
54
|
|
|
|
|
55
|
|
|
class ThreeWayQuickSortTest(unittest.TestCase): |
|
56
|
|
|
def test_sort(self): |
|
57
|
|
|
a = [4, 2, 1, 23, 4, 5, 6, 7, 8, 9, 20, 11, 13, 34, 66] |
|
58
|
|
|
ThreeWayQuickSort.sort(a) |
|
59
|
|
|
print(a) |
|
60
|
|
|
self.assertEqual(1, a[0]) |
|
61
|
|
|
self.assertEqual(2, a[1]) |
|
62
|
|
|
self.assertEqual(4, a[2]) |
|
63
|
|
|
|
|
64
|
|
|
|
|
65
|
|
|
class HeapSortTest(unittest.TestCase): |
|
66
|
|
|
def test_sort(self): |
|
67
|
|
|
a = [4, 2, 1, 23, 4, 5, 6, 7, 8, 9, 20, 11, 13, 34, 66] |
|
68
|
|
|
HeapSort.sort(a) |
|
69
|
|
|
print(a) |
|
70
|
|
|
self.assertEqual(1, a[0]) |
|
71
|
|
|
self.assertEqual(2, a[1]) |
|
72
|
|
|
self.assertEqual(4, a[2]) |
|
73
|
|
|
|
|
74
|
|
|
|
|
75
|
|
|
if __name__ == '__main__': |
|
76
|
|
|
unittest.main() |
|
77
|
|
|
|
chen0040 /
pyalgs
