Binary search involves searching a sorted list
The number of values that will be examined is 15
The equation that calculates the number of values that will be examined is:
[tex]2^{n -1} = N[/tex]
Where n represents the number of values to examine and N represents the number of time stamps
So, we have:
[tex]2^{n -1} = 10000[/tex]
Take the log of both sides
[tex]\log(2^{n -1}) = \log(10000)[/tex]
Apply the laws of logarithm
[tex][n - 1]\log(2) = 4[/tex]
Divide both sides y log(2)
[tex]n - 1 = 13.2[/tex]
The next integer greater than 13.2 is 14.
So, we have:
[tex]n - 1 = 14[/tex]
Add 1 to both sides
[tex]n = 15[/tex]
Hence, the number of values that will be examined is 15
Read more about binary search at:
https://brainly.com/question/20411780