Question

What is the best and worst case analysis of binary search?

Answer 1

Best case binary search would be when an element you are searching is present at middle location in the sorted array. This way you require only constant time ie O(1) to find the element.