Calculate how many guesses in binary search algorithm.

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:

57 732

step-by-step explanation:

i dont really.know

step-by-step explanation:

ok so im not 100% sure but you would start by adding 5.1t and 1.9t beacuse they have the same variable. that is 7t.   then add -3.6 + 1.2 which is -2.4

so then keep that as -2.4 + 7t. i apologize if this is incorrect. best luck on your test < 3