The complexity of Binary search algorithm is ___

The complexity of Binary search algorithm is ___ Correct Answer O (log n)

Binary search runs in at worst logarithmic time, making O ( log n) comparison , where n is the number of elements in the array, the O is Big O notation, and log is the logarithm .

Related Questions

Can linear search recursive algorithm and binary search recursive algorithm be performed on an unordered list?
The complexity of Binary search algorithm is ---