Solving the Maximum Pairwise Product Algorithm

What is the Maximum Pairwise Product? It means that we have to find the maximum product of two distinct numbers in a given array of non-negative numbers. Problem Statement Given a sequence of non-negative integers a0,…,an−1, find the maximum pairwise...