What is the difference between linear search and binary search?

What is the difference between linear search and binary search?

Linear search checks each element one by one, while binary search divides the list in half to find the target.

Which one is faster?

Binary search is generally faster, especially for large, sorted lists, as it reduces the search space significantly.

Can you give me an example of each?

Sure! In linear search, you might look through an unsorted list of numbers. In binary search, you would need a sorted list and repeatedly divide it in half.

When should I use linear search instead of binary search?

Use linear search when the list is unsorted or small, as the overhead of sorting for binary search may not be worth it.