﻿ Python: Find a pair with highest product from a given array of integers - w3resource

# Python: Find a pair with highest product from a given array of integers

## Python: Array Exercise-17 with Solution

Write a Python program to find a pair with the highest product from a given array of integers.

Examples :
Input: arr[] = {1, 2, 3, 4, 7, 0, 8, 4}
Output: {7,8}
Input: arr[] = {0, -1, -2, -4, 5, 0, -6}
Output: {-4, -6}

Sample Solution:

Python Code :

``````def max_Product(arr):
arr_len = len(arr)
if (arr_len < 2):
print("No pairs exists")
return
# Initialize max product pair
x = arr; y = arr

# Traverse through every possible pair
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

nums = [1, 2, 3, 4, 7, 0, 8, 4]
print("Original array:", nums)
print("Maximum product pair is:", max_Product(nums))

nums = [0, -1, -2, -4, 5, 0, -6]
print("\nOriginal array:", nums)
print("Maximum product pair is:", max_Product(nums))
``````

Sample Output:

```Original array: [1, 2, 3, 4, 7, 0, 8, 4]
Maximum product pair is: (7, 8)

Original array: [0, -1, -2, -4, 5, 0, -6]
Maximum product pair is: (-4, -6)
```

Python Code Editor: