Linear and Binary Search Algorithms

Linear Search

• This method checks each item in the list one by one.
• Example: If you want to find the number 4 in the list [1, 2, 3, 4, 5], it starts at the first number and continues until it finds 4.
• When to use: It is best for small lists or lists that aren't sorted.

Binary Search

• This method splits the list in half to find what you're looking for.
• It only works on lists that are sorted.
• Example: In the sorted list [1, 2, 3, 4, 5], it checks the middle number (3). If it's looking for 4, it hops to the right side where 4 is located.
• When to use: It’s very efficient for large sorted lists.

Both of these methods are important for searching. Each has its own strengths!