Question 1

What is the time complexity of Binary Search?

Accepted Answer

Binary Search has a time complexity of O(log n) in the worst and average cases, as it halves the search space with each comparison. This is because the input array must be sorted.

Question 2

When is Linear Search a better choice than Binary Search?

Accepted Answer

Linear Search is a better choice than Binary Search when the input array is not sorted, or when the array is small. For unsorted arrays, binary search cannot be applied. For very small arrays, the overhead of sorting for binary search might not be worth it compared to a simple linear scan.

Searching Algorithms Performance Interview

Related Algorithm Guides