Question 1

What is the difference between binary search and linear search?

Accepted Answer

Linear search checks each element of a list sequentially, with a time complexity of O(n). Binary search, on the other hand, works on sorted arrays and repeatedly divides the search interval in half, with a time complexity of O(log n).

Question 2

When is binary search not applicable?

Accepted Answer

Binary search is not applicable on unsorted data. It requires the data to be sorted to work correctly.

Searching Algorithms Interview Questions

Related Algorithm Guides