def Sorting_t(a,b):
c=[]
d=[]
for i in a:
ct=timeit.timeit(lambda: s.merge(b[:i]),number=10 )
c.append(ct)
dt=timeit.timeit(lambda : s.QuickSort(b[:i]), number=10)
d.append(dt)
Show_graph(a,[c,d], ['Merge sort', 'Quick sort'])
plt.title('Sorting time')
plt.show()
def test_QuickSort(self):
"""! Testing of quick sort method """
tst26 = [1, 2, 3, 7, 5, 6, 4]
true_tst26 = [1, 2, 3, 4, 5, 6, 7]
self.assertEqual(true_tst26, Sort.QuickSort(tst26))
tst27 = [-1, -2, -3, -7, -5, -6, -4]
true_tst27 = [-7, -6, -5, -4, -3, -2, -1]
self.assertEqual(true_tst27, Sort.QuickSort(tst27))
tst28 = [10, -2, 3, -7, 5, 6, -4]
true_tst28 = [-7, -4, -2, 3, 5, 6, 10]
self.assertEqual(true_tst28, Sort.QuickSort(tst28))
tst29 = [5.0, 4.0, 3.0, 2.0, 1.0]
true_tst29 = [1.0, 2.0, 3.0, 4.0, 5.0]
self.assertEqual(true_tst29, Sort.QuickSort(tst29))
tst30 = []
true_tst30 = []
self.assertEqual(true_tst30, Sort.ShellSort(tst30))
# -*- coding: utf-8 -*- import Sort #Sort.testAlgorithms([10, 20, 30, 40, 50, 60]) test = [3,2,3,4,45,66,1,22,42] #Sort.Bubble(test) Sort.QuickSort(test, 0, len(test) - 1, rand = True) print(test)
import Sort
A = [1, 7, 5, 8, 3, 5, 3, 4, 2]
print('A = ', A)
result1 = Sort.InsertionSort(A)
print('by Insertition-Sort:', result1)
result2 = Sort.MergeSort(A)
print('by Merge-Sort:', result2)
result3 = Sort.QuickSort(A, 0, len(A) - 1)
print('by Quick-Sort:', result3)
result4 = Sort.bucketSort(A)
print('by Bucket-Sort:', result4)
