Answer:
22
Step-by-step explanation:
-4u - 5 = 3
=> -4u = 8
=> u = -2
=> 7(-2) - 8
=> -14 - 8
=> -22
Therefore, -22 is our answer.
Hoped this helped.
Answer:
In the case of a decimal number, we round down to find the actual number of guesses. Therefore, for a 1000-element array, binary search would require at most 10 guesses. (which is 2,097,152), so we would need at most 22 guesses.
Step-by-step explanation: