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)16
B)30
C)20
D)1

Question

Quizplus · Accepted Answer

Binary search has a time complexity of O(log2(n)), where n is the number of elements. For 1,000,000 elements, log2(1,000,000) is approximately 20, meaning in the worst case, about 20 visits are needed.

Suppose We Are Using Binary Search on an Array with Approximately