Suppose you are given an unsorted array of n distinct elements where n is a power of 2 . How will you identify the second largest element with minimum number of comparisons?
Total number of elements in the input array = \( n = 2^{k} \) (given) |