/
main.py
97 lines (83 loc) · 2.87 KB
/
main.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
import Util
import RadixSort
import HeapSort
import InsertionSort
import MergeSort
import QuickSort
import PythonSorted
import SelectionSort
import Sort
import time
"""
for i in range(5):
L = Util.generateList()
A = QuickSort.QuickSort(L)
"""
sizeList = [10, 50]
for i in range(len(sizeList)):
L = Util.generateList(sizeList[i])
M = Util.generateSorted(sizeList[i])
N = Util.generateReversed(sizeList[i])
O = Util.generateSmallRange(sizeList[i])
#listList = [L, M, N, O]
#listNames = ['Random', 'Sorted', 'Reversed', 'SmallRange']
listList = [L, M, O]
listNames = ['Random', 'Sorted', 'SmallRange']
timesList = [[], [], [], [], [], [], []]
for x in range(len(listList)):
#L = listList[x]
L = Util.generateList(sizeList[i])
A = QuickSort.QuickSort(L)
B = HeapSort.HeapSort(L)
C = InsertionSort.InsertionSort(L)
D = MergeSort.MergeSort(L)
E = PythonSorted.PythonSorted(L)
F = SelectionSort.SelectionSort(L)
G = RadixSort.RadixSort(L)
sortList = [A, B, C, D, E, F, G]
sortNames = ['Quick', 'Heap', 'Insertion', 'Merge', 'Python', 'Selection', 'Radix']
#sortList = [C]
#sortNames = ['Insertion']
for j in range(len(sortList)):
Start = time.time()
M = sortList[j].sort(L)
runTime = (time.time() - Start) * 1000000
runTime = float("{0:.2f}".format(runTime))
timesList[j].append(runTime)
#print(sortList[2])
if listNames[x] is 'Random':
f = open('RandomSizeList-Range100XSize.csv', 'w')
f.write('Random Size List. Range 100XSize \n')
elif listNames[x] is 'Sorted':
f = open('SortedList-Range100XSize.csv', 'w')
f.write('Sorted List. Range 100XSize\n')
elif listNames[x] is 'Reversed':
f = open('ReversedList-Range100XSize.csv', 'w')
f.write('Reversed List. Range 100XSize\n')
else:
assert listNames[x] is 'SmallRange'
f = open('LittleRange-Range_one_fifth_XSize.csv', 'w')
f.write('Small Range. 1/5 List Size\n')
for j in range(len(sizeList)):
f.write(', ' + str(sizeList[j]))
f.write('\n')
for j in range(len(sortNames)):
f.write(sortNames[j])
for k in range(len(timesList[j])):
f.write(", " + str(timesList[j][k]))
f.write("\n")
print('\n\n' + listNames[x])
print("quicksort")
print(timesList[0])
print("Heap Sort")
print(timesList[1])
print("Insertion sort")
print(timesList[2])
print("Mergesort")
print(timesList[3])
print("PythonSorted")
print(timesList[4])
print("selection sort")
print(timesList[5])
print("radix sort")
print(timesList[6])