def test_quick_sort4():
actual = quick_sort([2, 3, 5, 7, 13, 11])
excpected = [2, 3, 5, 7, 11, 13]
assert excpected == actual
def test_quick_sort():
actual = quick_sort([5, 2, 6, 0])
excpected = [0, 2, 5, 6]
assert excpected == actual
def test_quick_sort2():
actual = quick_sort([20, 18, 12, 8, 5, -2])
excpected = [-2, 5, 8, 12, 18, 20]
assert excpected == actual
def test_quick_sort3():
actual = quick_sort([5, 12, 7, 5, 5, 7])
excpected = [5, 5, 5, 7, 7, 12]
assert excpected == actual
def test_quick_sort_simple():
arr = [8, 4, 23, 42, 16, 15]
expected = [4, 8, 15, 16, 23, 42]
quick_sort(arr, 0, len(arr) - 1)
assert arr == expected
def test_quick_sort_reverse():
arr = [20, 18, 12, 8, 5, -2]
expected = [-2, 5, 8, 12, 18, 20]
quick_sort(arr, 0, len(arr) - 1)
assert arr == expected
def test_quick_sort_few_unique():
arr = [5, 12, 7, 5, 5, 7]
expected = [5, 5, 5, 7, 7, 12]
quick_sort(arr, 0, len(arr) - 1)
assert arr == expected
def test_quick_sort_nearly_sorted():
arr = [2, 3, 5, 7, 13, 11]
expected = [2, 3, 5, 7, 11, 13]
quick_sort(arr, 0, len(arr) - 1)
assert arr == expected
def test_sort_1():
arr = [2, 1, 99, 88, 100, 14, 5]
arr = quick_sort(arr)
actual = arr
expected = [1, 2, 5, 14, 88, 99, 100]
assert actual == expected
def test_sort_3():
arr = []
arr = quick_sort(arr)
actual = arr
expected = []
assert actual == expected
def test_sort_2():
arr = [0, 9, 7, 3, 1]
arr = quick_sort(arr)
actual = arr
expected = [0, 1, 3, 7, 9]
assert actual == expected
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_quick_sort(self, lst, sorted_lst):
assert quick_sort(lst) == sorted_lst
