What is the efficiency of binary search?
A) n²
B) n
C) log₂ n
D) n/2
E) none of the above

Question

Quizplus · Accepted Answer

C) With each comparison binary search eliminates approximately half of the remaining data. This process continues until either the sought element is found or until all possible data has been eliminated. Since there are n data elements, the number of times one can halve the data before the amount of data is less than one element is log₂ n.

What Is the Efficiency of Binary Search