def test_bitonic_sort(self): self.assertEqual([1, 2, 3, 5, 23, 57, 65, 1232], bitonic_sort([1, 3, 2, 5, 65, 23, 57, 1232])) self.assertEqual([1, 2, 3, 5, 23, 57, 65, 1232], bitonic_sort([1, 3, 2, 5, 65, 23, 57, 1232], False)) self.assertEqual([1232, 65, 57, 23, 5, 3, 2, 1], bitonic_sort([1, 2, 3, 5, 65, 23, 57, 1232], True))
def test_bitonic_sort(self): self.assertEqual([1, 2, 3, 5, 23, 57, 65, 1232], bitonic_sort([1, 3, 2, 5, 65, 23, 57, 1232])) self.assertEqual([1, 2, 3, 5, 23, 57, 65, 1232], bitonic_sort([1, 3, 2, 5, 65, 23, 57, 1232],False)) self.assertEqual([1232, 65, 57, 23, 5, 3, 2, 1], bitonic_sort([1, 2, 3, 5, 65, 23, 57, 1232],True))
def test_insertion_sort(self): self.assertTrue(is_sorted(bitonic_sort([1, 3, 2, 5, 65, 23, 57, 1232])))
from algorithms.sort import bitonic_sort import random # it can only 2**n cases alist=[ random.randint(1,10) for i in range(1024)] print(alist) sorted_list=bitonic_sort(alist,reverse=False) print(sorted_list)