#AP Computer Science Principles: Search Algorithms Study Guide

Hey there! Let's get you prepped for the exam with a deep dive into search algorithms. We'll make sure you're not just memorizing but truly understanding how these concepts work. Let's do this!

#Searching and Sorting Algorithms

#Linear (Sequential) Search

• How it works: Checks each item in a list, one by one, in order.
• Analogy: Imagine looking for a specific book on a shelf by starting at one end and checking each book until you find the right one.
• When to use it: Useful for unsorted lists or when you don't know the order of items. It's simple but can be slow for large lists.
• Example:

  List: [3, 7, 1, 9, 4]
  Searching for: 9
  Steps: Check 3, then 7, then 1, then 9 (found!)
  

#Binary Search

• How it works: Repeatedly divides a sorted list in half, eliminating half of the remaining elements in each step. It checks the middle element and narrows down the search based on whether the target is higher or lower.
• Analogy: Think of looking up a word in a dictionary. You don't start at page one; you open to the middle, then adjust forward or backward based on the letter you're looking for.
• When to use it: Efficient for sorted lists because it quickly narrows down the search space. Much faster than linear search for large lists.
• Key Requirement: The list must be sorted before you can use binary search.
• Example:

  Sorted Lis...