from QuickSort912 import Solution as QuickSort
from HeapSort912 import Solution as HeapSort

testcases = [
    [5, 2, 3, 1],
    [5, 1, 1, 2, 0, 0],
    [1, 2, 3, 4],
    [4, 9, 4, 4, 1, 9, 4, 4, 9, 4, 4, 1, 4],
]


# The worst case will TLE
def test_QuickSort():
    for nums in testcases:
        assert QuickSort().sortArray(nums.copy()) == sorted(nums)

def test_HeapSort():
    for nums in testcases:
        assert HeapSort().sortArray(nums.copy()) == sorted(nums)

2986b0daa9bf76d3e2aa256bc41e057f4f6520a7
<mask token>


def test_HeapSort():
    for nums in testcases:
        assert HeapSort().sortArray(nums.copy()) == sorted(nums)

<mask token>


def test_QuickSort():
    for nums in testcases:
        assert QuickSort().sortArray(nums.copy()) == sorted(nums)


def test_HeapSort():
    for nums in testcases:
        assert HeapSort().sortArray(nums.copy()) == sorted(nums)

<mask token>
testcases = [[5, 2, 3, 1], [5, 1, 1, 2, 0, 0], [1, 2, 3, 4], [4, 9, 4, 4, 1,
    9, 4, 4, 9, 4, 4, 1, 4]]


def test_QuickSort():
    for nums in testcases:
        assert QuickSort().sortArray(nums.copy()) == sorted(nums)


def test_HeapSort():
    for nums in testcases:
        assert HeapSort().sortArray(nums.copy()) == sorted(nums)

from QuickSort912 import Solution as QuickSort
from HeapSort912 import Solution as HeapSort
testcases = [[5, 2, 3, 1], [5, 1, 1, 2, 0, 0], [1, 2, 3, 4], [4, 9, 4, 4, 1,
    9, 4, 4, 9, 4, 4, 1, 4]]


def test_QuickSort():
    for nums in testcases:
        assert QuickSort().sortArray(nums.copy()) == sorted(nums)


def test_HeapSort():
    for nums in testcases:
        assert HeapSort().sortArray(nums.copy()) == sorted(nums)

from QuickSort912 import Solution as QuickSort
from HeapSort912 import Solution as HeapSort

testcases = [
    [5, 2, 3, 1],
    [5, 1, 1, 2, 0, 0],
    [1, 2, 3, 4],
    [4, 9, 4, 4, 1, 9, 4, 4, 9, 4, 4, 1, 4],
]


# The worst case will TLE
def test_QuickSort():
    for nums in testcases:
        assert QuickSort().sortArray(nums.copy()) == sorted(nums)

def test_HeapSort():
    for nums in testcases:
        assert HeapSort().sortArray(nums.copy()) == sorted(nums)
