You are given a set of objects and compare function. You have to find the third largest object. You can use a predefined "Comapre to" function for object comparison, but its very expensive function so minimize the usage of "Compare to".
There are better options than using a max heap of size 3. How to solve this question?