Prove that any comparison-based algorithm for finding the largest element of an n-element set of real numbers must make n − 1 comparisons in the worst
case.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.