def list_test():
s = [11, 33, 22, 55, 44]
for v in s:
print(v)
a = 1
b = 3
print(s[a:b])
print(s.sort())
print(str(s))
print('bubble_sort: ', bubble_sort.sort(s))
print('quick_sort: ', quick_sort.sort(s))
xx = [x * x for x in range(10)]
print(xx)
def srt_operations(f_code, v):
if f_code == 1:
res = bogo_sort.sort(v)
return res
elif f_code == 2:
res = bubble_sort.sort(v)
return res
elif f_code == 3:
res = cocktail_sort.sort(v)
return res
elif f_code == 4:
res = comb_sort.sort(v)
return res
elif f_code == 5:
res = gnome_sort.sort(v)
return res
elif f_code == 6:
res = heap_sort.sort(v)
return res
elif f_code == 7:
res = insertion_sort.sort(v)
return res
elif f_code == 8:
res = merge_sort.sort(v)
return res
elif f_code == 9:
res = quick_sort.sort(v)
return res
elif f_code == 10:
res = quick_sort_in_place.sort(v, 0, len(v) - 1)
return res
elif f_code == 11:
res = selection_sort.sort(v)
return res
elif f_code == 12:
res = shell_sort.sort(v)
return res
def test_bubblesort(self):
self.output = bubble_sort.sort(self.input)
self.assertEqual(self.correct, self.output)
def test_bubblesort(self):
self.output = bubble_sort.sort(self.input)
self.assertEqual(self.correct, self.output)
def test_bubble_sort_desc(self):
# Descending
self.output = bubble_sort.sort(self.input, False)
self.assertEqual(self.correct_inverse, self.output)
def test_bubble_sort(self):
# Default: True-ASC; False-DESC
self.output = bubble_sort.sort(self.input)
self.assertEqual(self.correct, self.output)
def test_bubble_sort(self, array):
assert not is_sorted(array)
bubble_sort.sort(array)
assert is_sorted(array)