Question: ASAP Consider the claim: Any comparison-based algorithm for finding the maximum of n distinct elements must use at least 1 - 1 comparisons. In an
Consider the claim: "Any comparison-based algorithm for finding the maximum of n distinct elements must use at least 1 - 1 comparisons". In an attempt to prove the above claim, a student wrote: "For every comparison there is a winner and a loser. The ultimate winner (e the maximum) must compare against all other elements. Therefore there must be n-1 comparisons." Is this argument correct? Justify your
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
