Question

A sorted list of numbers contains 200 elements. Which of the following is closest to the maximum number of list elements that will need to be examined when performing a
binary search for a particular value in the list?

Answer 1

Answer:

Its 8

Explanation:

got it right on collegeboard

Answer 2

Binary search is a fast way of finding a particular piece in an ordered list of things, and further calculation can be defined as follows:

• This algorithm begins in the middle of the sorted array and removes half of such elements at quite a time until the target value is found or all of the components are removed.
• In each list of 200 elements would be split in half a maximum of seven times with a total of 8 elements examined.
• This list starts at 200 elements, but drops to 100, then 50, then 25, then 12 elements, then 6 elements, then 3 elements, until ultimately 1 element.

Therefore the final answer is "8".

Learn more:

brainly.com/question/21033909