Question

A time stamp indicates the date and time that a measurement was taken. A data scientist has a list containing 10,000 time stamps, sorted in chronological order. Which of the following is closest to the maximum number of values that will need to be examined when performing a binary search for a value in the list?.

Answer 1

Binary search involves searching a sorted list

The number of values that will be examined is 15

How to determine the number of examined values

The equation that calculates the number of values that will be examined is:

$2^{n -1} = N$

Where n represents the number of values to examine and N represents the number of time stamps

So, we have:

$2^{n -1} = 10000$

Take the log of both sides

$\log(2^{n -1}) = \log(10000)$

Apply the laws of logarithm

$[n - 1]\log(2) = 4$

Divide both sides y log(2)

$n - 1 = 13.2$

The next integer greater than 13.2 is 14.

So, we have:

$n - 1 = 14$

Add 1 to both sides

$n = 15$

Hence, the number of values that will be examined is 15

Read more about binary search at:

brainly.com/question/20411780