How do different search algorithms compare in efficiency?

What are the main differences between linear search and binary search?

Linear search checks each element one by one, while binary search divides the list in half, making it faster for sorted lists.

In what scenarios would I prefer linear search over binary search?

You'd prefer linear search for small or unsorted datasets, where the overhead of sorting for binary search isn't worth it.

Can you explain how depth-first search differs from breadth-first search?

Depth-first search explores as far as possible down one branch before backtracking, while breadth-first search explores all neighbors at the present depth before moving on.

Which search algorithm is generally more efficient for large datasets?

For large datasets, binary search is generally more efficient if the data is sorted, while algorithms like A* or Dijkstra's are better for pathfinding.