How do binary search and linear search differ?

How do binary search and linear search differ?

Binary search is faster and more efficient than linear search, but it requires a sorted array. Linear search works on unsorted arrays.

Can you explain how binary search works?

Sure! Binary search divides the search interval in half repeatedly, checking if the target value is in the left or right half.

What about the time complexity of both algorithms?

Linear search has a time complexity of O(n), while binary search has a time complexity of O(log n), making binary search much faster for large datasets.

Are there any scenarios where linear search is preferred?

Yes, linear search is preferred for small or unsorted datasets where the overhead of sorting for binary search isn't justified.