Naive Solution: Maximum Pairwise Product

Naive algorithm

A naive way to solve the Maximum Pairwise Product Problem is to go through all possible pairs of the input elements $A[1...n] = [a_1,...,a_n]$ and to find a pair of distinct elements with the largest product, as given in the following pseudocode.

---

 $MaxPairwiseProductNaive(A[1 . . . n])$:
  $product \leftarrow 0$ ...