Respuesta :
The values that binary search must examine at most is A. 7.
What is binary search?
Binary search is a type of search for array in many programming language. Binary search work is to divide the array into two part repeatedly until the value is found.
Examined process of binary search can be calculated mathematically using [tex]log_2[/tex]. Then, [tex]log_2[/tex] (100) is equal to 6.64, we round up so we get 7.
For visualization the logic we only need to divide the amount of item in array by 2 until the result is approximately 1. So,
100 / 2 = 50
50 / 2 = 25
25 / 2 = 12.5 (round up to 13)
13 / 2 = 6.5 (round up to 7)
7 / 2 = 3.5 (round up to 4)
4 / 2 = 2
2 / 2 = 1
So, we divide 100 item array by 2 for 7 times. Then, the values must binary search examine at most is 7.
Learn more about array here:
brainly.com/question/28565733
#SPJ4
