Question: Given an array of distinct integers. You need to find the maximum product of twointegers in an array. For example, consider the array {-10, -3,

Given an array of distinct integers. You need to find the maximum product of twointegers in an array.

For example, consider the array {-10, -3, 5, 6, -2}

. The maximum product is formed by the (-10, -3) or (5, 6) pair.

Suggest a sub-quadratic running time complexity algorithm (only pseudo code) to solve this problem. What is the overall complexity of your solution? Justify

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!