Consider the task of searching a sorted array A[1... n] for a given element x: a task we usually perform by binary search in time O (log n). Show that any algorithm that accesses the array only via comparisons (that is, by asking questions of the form “is A[i]
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.