1. What is an algorithm?

Simple steps to solve a problem. Think of it like a recipe for cooking: step 1, step 2, step 3 to get the result.

2. Explain the difference between linear search and binary search.

• Linear Search: Checking items one by one, like reading every page of a book to find a word. Works on any list.
• Binary Search: Only works on sorted lists. You open the book in the middle; if the word is before, you ignore the second half and repeat. It cuts the search area in half every time.

3. What is the time complexity of linear search and binary search?