Question: 
Write a function to find a pair with the highest product from a given array of integers.


Model's Code:
def max_product(arr):
    arr = sorted(arr)
    return (arr[-1], arr[-2]) if arr[-1] * arr[-2] >= arr[0] * arr[1] else (arr[0], arr[1])



Sample Correct Code:
def max_product(arr): 
    arr_len = len(arr) 
    if (arr_len < 2): 
        return None     
    x = arr[0]; y = arr[1]    
    for i in range(0, arr_len): 
        for j in range(i + 1, arr_len): 
            if (arr[i] * arr[j] > x * y): 
                x = arr[i]; y = arr[j] 
    return x,y   


Asserts:
assert max_product([1, 2, 3, 4, 7, 0, 8, 4])==(7, 8)
assert max_product([0, -1, -2, -4, 5, 0, -6])==(-4, -6)
assert max_product([1, 3, 5, 6, 8, 9])==(8,9)


Tests:
Test 1 of 3: FAIL: AssertionError()

Test 922 of 974: 707/922 (76.68112798264643%): failed