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

A binary search will remove around half the elements every iteration (assuming the element is not found).

500 → 250 → 125 → 63 → 32 → 16 → 8 → 4 → 2 → 1