Binary Search

Question

What is the worst case complexity for searching for a key in a sorted array using Binary Search??

Comments

O(n)..

skewed binary search tree..

---

sorry - O(log n).

Answer 1

In a sorted array, we can apply binary search algorithm which takes O($logn$) time in worst case to search a key.

Reference:Binary search

Comments

Thanks :)

Answer 2

binary serach = O(log(n))