📚 Topic Summary
Recursive Binary Search is like a super-efficient way to find something in a sorted list. Imagine you're looking for a specific word in a dictionary. Instead of flipping through every page, you open the dictionary in the middle. If your word comes before the middle word, you only search the first half. If it comes after, you only search the second half. This 'divide and conquer' approach repeats until you find the word! This unplugged activity helps you grasp this concept without writing a single line of code.
The core idea is to repeatedly divide the search interval in half. If the middle element is the target value, we're done! If the target is less than the middle element, we search the left half; otherwise, we search the right half. This process continues until the target is found or the interval is empty.
🧠 Part A: Vocabulary
Match the term with its definition:
| Term |
Definition |
| 1. Binary Search |
A. The value you are looking for. |
| 2. Sorted List |
B. An ordered collection of items. |
| 3. Target Value |
C. Repeatedly calling a function within itself. |
| 4. Recursion |
D. A search algorithm that repeatedly divides the search interval in half. |
| 5. Middle Element |
E. The item located in the center of the search interval. |
✍️ Part B: Fill in the Blanks
Complete the following sentences using the words: divide, sorted, middle, target, recursion.
Binary search works best on a ________ list. It involves repeatedly ________ the search interval in half. We compare the ________ element to the ________ value. The process often uses ________ to repeatedly search smaller portions of the list.
💡 Part C: Critical Thinking
Explain, in your own words, why binary search is more efficient than a simple linear search (checking each item one by one) when searching a large, sorted list. Can you think of a real-world example where binary search would be useful?
