
(8) Consider the problem for finding the maximum of n numbers. Prove that any algorithm that solves this problem by only comparing, has to perform at least n – 1 comparisons in the worst case. Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .