Consider the problem of finding the largest and second largestelements from a set of n elements.
b) Give a divide and conquer algorithm and show that it takes 3n2 − 2 comparisons when n is a power of 2.
Expert Answer
An answer will be send to you shortly. . . . .