A binary search function is searching for a value that is stored in the middle element of an array. How many times will the function read an element in the array before finding the value?
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.