Question: Design an algorithm to find both the largest and the smallest elements in a list with n elements such that at most 2n-3 comparisons

Design an algorithm to find both the largest and the smallest elements in a list with n elements such that at most 2n-3 comparisons are needed. You may assume that n is a power of 2. I (i) Determine the exact number of comparisons of your algorithm. (ii) How does the number of comparisons change, if n is not a power of 2?
Step by Step Solution
3.38 Rating (154 Votes )
There are 3 Steps involved in it
To find both the largest and smallest elements in a list of n elements with at most 2n3 comparisons ... View full answer
Get step-by-step solutions from verified subject matter experts
