Let A[1..n] be an array of distinct numbers, and assume that the number of elements n 2 is a power of 2 (that is, 2, 4, 8, 16, ...).

Give an iterative algorithm that finds the second largest element in A by performing no more than 3n/2 2 comparisons.