Suppose we are using binary search on an array with approximately 1,000,000 elements. How many visits should we expect to make in the worst case?
A) 1
B) 16
C) 20
D) 30

Question

Quizplus · Accepted Answer

Binary search has a time complexity of O(log n). For 1,000,000 elements, log2(1,000,000) is approximately 20, so in the worst case, we would expect to make about 20 visits.

Suppose We Are Using Binary Search on an Array with Approximately