Prove that any algorithm that finds an element X in a sorted list of N elements requires Ω(logN) comparisons.
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.