Given a database D of n cost-performance pairs (c, p), describe an algorithm for finding the maxima pairs of C in O(nlogn) time
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'.