The complexity of Binary search algorithm is
A. O(n)
B. O(log )
C. O(n2)
D. O(n log n)
Answer:A
The complexity of Binary search algorithm is
A. O(n) B. O(log ) C. O(n2) D. O(n log n)
Explanation: This shows that it has a standard complexity in addressing.