Binary search with duplicates. Modify rank() so that it returns the index in the array of the first (or last) entry equal to the query key. The order of growth of your method should be log N in the worst case, even if there are many entries in the array equal to the query key.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.