from count_inversion import sort_and_count with open('IntegerArray.txt', 'rb') as f: numbers = [int(str.strip(line)) for line in f.readlines()] print(numbers[:4]) result = sort_and_count(numbers) print(len(result[0])) print(result[1])
def test_can_sort_a_list(self): unsorted_list = [1, 3, 5, 2, 4, 6] returned_list = count_inversion.sort_and_count(unsorted_list)[0] sorted_list = sorted(unsorted_list) self.assertEqual(returned_list, sorted_list)
def test_final_count2(self): unsorted_list = [2, 4, 1, 3, 5] returned_count = count_inversion.sort_and_count(unsorted_list)[1] self.assertEqual(returned_count, 3)
def test_final_count(self): unsorted_list = [6, 5, 4, 3, 2, 1] returned_count = count_inversion.sort_and_count(unsorted_list)[1] self.assertEqual(returned_count, 15)
def test_base_case(self): singleton_list = [5] inversion_count = count_inversion.sort_and_count(singleton_list)[1] self.assertEqual(inversion_count, 0)