def test_can_read_data(self): filename = 'algo1-programming_prob-2sum.txt' list_ = stanford.read_file(filename) list_.sort() set_ = set(list_) search_list = list(range(-10000, 10001)) search_results = TwoSumHash.search_list(search_list, set_) print(sum(search_results))
def test_sort_median_as_pivot(self): filename = 'QuickSort.txt' data = stanford.read_file(filename) qs = QuickSort(pivot_strategy='median') qs.sort(data) self.assertEqual(qs.comparisons, 138382)
def test_sort_last_as_pivot(self): filename = 'QuickSort.txt' data = stanford.read_file(filename) qs = QuickSort(pivot_strategy='last') qs.sort(data) self.assertEqual(qs.comparisons, 164123)
def test_sort_first_as_pivot(self): filename = 'QuickSort.txt' data = stanford.read_file(filename) qs = QuickSort() qs.sort(data) self.assertEqual(qs.comparisons, 162085)
def test_expected_data_in_file(self): filename = 'QuickSort.txt' data = stanford.read_file(filename) self.assertEqual(data[0:4], [2148, 9058, 7742, 3153])
def test_can_read_in_file(self): filename = 'Median.txt' numbers = stanford.read_file(filename) mm = MedianMaintenance() mm.loop_insert(numbers) print(mm.modulo_median())