Question: Describe (at a high level) an algorithm to find the largest and second largest elements in an array using at most n + log n
Describe (at a high level) an algorithm to find the largest and second largest elements in an array using at most n + log n comparisons. That is, we only care about the number of comparisons between values in the array. Hint: Assume n is a power of 2 and think about having a tournament to determine the largest element
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
