def test_quick_sort_empty(): arr = [] n = len(arr) expected = [] quick_sort(arr, 0, n - 1) actual = print_list(arr) assert actual == expected
def test_quick_sort_1(): arr = [8, 4, 23, 42, 16, 15] n = len(arr) expected = [4, 8, 15, 16, 23, 42] quick_sort(arr, 0, n - 1) actual = print_list(arr) assert actual == expected
def test_quick_sort_str(): arr = ["1", "-1", "3"] n = len(arr) expected = ["-1", "1", "3"] quick_sort(arr, 0, n - 1) actual = print_list(arr) assert actual == expected
def test_quick_sort_3(): arr = [5, 12, 7, 5, 5, 7] n = len(arr) expected = [5, 5, 5, 7, 7, 12] quick_sort(arr, 0, n - 1) actual = print_list(arr) assert actual == expected
def test_big_boi(): array = [random.randrange(0,5000,1) for _ in range(500)] copy_array = array copy_array.sort() quick_sort(array,0,len(array)-1) assert array == copy_array
def test_quick_sort_2(): arr = [20, 18, 12, 8, 5, -2] n = len(arr) expected = [-2, 5, 8, 12, 18, 20] quick_sort(arr, 0, n - 1) actual = print_list(arr) assert actual == expected
def test_quick_sort_4(): arr = [2, 3, 5, 7, 13, 11] n = len(arr) expected = [2, 3, 5, 7, 11, 13] quick_sort(arr, 0, n - 1) actual = print_list(arr) assert actual == expected
def test_quick_sort_works_correct(self): lst = [5, 4, 3, 2, 1] quick_sort(lst) self.assertEqual(lst, [1, 2, 3, 4, 5]) lst = [1, 3, 2, 5, 4] quick_sort(lst) self.assertEqual(lst, [1, 2, 3, 4, 5]) lst = [3, 1, 4, 2, 5] quick_sort(lst) self.assertEqual(lst, [1, 2, 3, 4, 5])
#!/usr/bin/env python3 import utils # from merge_sort import merge_sort from quick_sort import quick_sort from quick_sort import quick_sort_with_count data = utils.load_array_from_file('data/QuickSort.txt') # data = utils.create_reversed_array(5) # data = [1, 5, 4, 3, 6] print(quick_sort.quick_sort(data)) # print(quick_sort_with_count.quick_sort(data))
def test_sort_random(): arr = [8, 4, 23, 42, 16, 15] quick_sort(arr) actual = arr expected = [4, 8, 15, 16, 23, 42] assert actual == expected
def test_nearly_sorted(): arr = [2, 3, 5, 7, 13, 11] quick_sort(arr) actual = arr expected = [2, 3, 5, 7, 11, 13] assert actual == expected
def test_duplicate_elements(): arr = [5, 12, 7, 5, 5, 7] quick_sort(arr) actual = arr expected = [5, 5, 5, 7, 7, 12] assert actual == expected
def test_in_reverse(): arr = [20, 18, 12, 8, 5, -2] quick_sort(arr) actual = arr expected = [-2, 5, 8, 12, 18, 20] assert actual == expected
def test_quick_sort_reverse_in(): arr = [20,18,12,8,5,-2] actual = quick_sort(arr) expected = [-2, 5, 8, 12, 18, 20] assert actual == expected
def test_few_uniques(): assert quick_sort([5,12,7,5,5,7],0,5)==[5,5,5,7,7,12]
def test_quick_sort(): array = [12,89,23,78,34,78,45,67] quick_sort(array,0,7) assert array == [12,23,34,45,67,78,78,89]
def test_big_array_sort(): array = [1,2,3,4,5,4,2,4,4,3,6,5,6,3,5,6,4,6,5,2435,543,234,654,567,76,789,987,345,432,123,345,456,567,678,686,543545,35454,354576767,464543423,4556677889,434354656778,775645434233454657,7879755,34232,4354657,676878,7978,664,53434,34] copy_array = array copy_array.sort() quick_sort(array,0,len(array)-1) assert array == copy_array
def test_simple_arr(): lst = [8,4,23,42,16,15] quick_sort(lst, 0, 5) assert lst == [4, 8, 15, 16, 23, 42]
def test_quick_sorting(test_lists, left, right, expected): actual = quick_sort(test_lists, left, right) assert actual == expected
def test_given_list_should_return_sorted_copy(input_list, expected_output): assert quick_sort(collection=input_list) == expected_output
def test_quick_sort_few(): arr = [5,12,7,5,5,7] actual = quick_sort(arr) expected = [5, 5, 5, 7, 7, 12] assert actual == expected
def test_will_fail_when_passed_letters(): expected = "Error" actual = quick_sort(["a", "z", "g", "w", "y", "s", "t"]) assert expected == actual
def test_quick_sort(): arr = [8, 4, 23, 42, 16, 15] actual = quick_sort(arr) expected = [4, 8, 15, 16, 23, 42] assert actual == expected
def test_nearly_sorted(): assert quick_sort([2,3,5,7,13,11],0,5)==[2,3,5,7,11,13]
def test_can_successfully_sort_an_unsorted_list(): expected = [4, 8, 15, 16, 23] actual = quick_sort(testing_list) assert expected == testing_list
def test_Reverse_sorted(): assert quick_sort([20,18,12,8,5,-2],0,5)==[-2,5,8,12,18,20]
def test_can_successfully_sort_a_list_with_negative_nubmers(): expected = [-16, 4, 8, 15, 23] actual = quick_sort(test_with_negative) assert expected == test_with_negative