How to find a toy in a crowded toy box (unplugged CS lesson)

🎯 Learning Objectives

• 💡 Students will be able to define and understand the concept of a search algorithm.
• 🚶‍♀️ Students will be able to describe the process of a linear search.
• ⏱️ Students will be able to compare the efficiency of different search strategies (e.g., random vs. systematic).
• 🧠 Students will begin to grasp the foundational idea of optimization in problem-solving.

🛠️ Materials Needed

• 📦 A large, opaque toy box or container.
• 🧸 A collection of various toys (at least 20-30, with one designated "target toy").
• 📝 Whiteboard or large paper for notes.
• 🖊️ Markers or pens.
• ⏱️ Stopwatch or timer (optional).
• 📋 Worksheet for recording observations (optional).

🧠 Warm-up (5 minutes)

• ❓ Start by asking students: "Imagine your toy box is super messy! How do you find your favorite toy quickly?"
• 🗣️ Encourage a quick brainstorm of strategies (e.g., "dump everything out," "look through one by one," "shake the box").
• 🤔 Introduce the idea that computers also "search" for things, like files on a hard drive or items in a list.

🧑‍🏫 Main Instruction: Unplugged Search Algorithms

Explain that today we'll be acting like computers to find a specific "target toy" in a "data set" (the toy box).

🔍 Activity 1: Linear Search (The "One-by-One" Method)

• ⚙️ Setup: Place the target toy somewhere in the box, hidden among other toys. Do not reveal its location.
• 📜 Concept: Explain that a "linear search" means checking each item one by one, in order, until you find what you're looking for.
• 🚶 Demonstration: Have a volunteer demonstrate a linear search. They reach into the box, pull out one toy, identify it, and if it's not the target, they put it aside and pick another.
• 📊 Discussion:
  • 🤔 Was this an efficient way to find the toy? Why or why not?
  • ⏱️ How many toys did they have to check? (Record this number).
  • ❓ What if the toy was the very first one they picked? What if it was the last? (Best-case, worst-case scenarios).
• 🔄 Repeat: Have another volunteer try, perhaps with a different target toy or a slightly reorganized box, to show variability.

📊 Activity 2: Binary Search (The "Divide and Conquer" Method - Advanced/Optional)

Note: This is more complex for an unplugged activity with a physical box but can be adapted conceptually. For a physical box, it's harder to implement a true binary search unless toys are 'sorted' in some way (e.g., by size, color, alphabetically if they have names). A more practical approach for an unplugged lesson is to introduce the idea of 'halving' the search space.

• ✨ Concept: Introduce the idea that if items are organized (sorted), you can find things much faster.
• 📚 Analogy: Think about looking up a word in a dictionary. You don't start from 'A' and go page by page. You open to the middle, decide if your word is before or after, then open to the middle of that section.
• 📏 Adaptation for Toy Box:
  • 🗂️ Briefly sort the toys into two halves (e.g., "big toys" and "small toys," or "red toys" and "blue toys").
  • ❓ Ask: "If our target toy is a small, blue car, which half should we look in first?"
  • ✂️ By eliminating half the possibilities, you've reduced the search space significantly.
• 📈 Discussion:
  • 💡 How does organizing the toys help us find things faster?
  • 🎯 What if we could divide the remaining toys in half again? (Introduce the idea of repeatedly halving).
  • Comparing linear vs. binary search efficiency: For $N$ items, linear search takes up to $N$ steps. Binary search takes up to $\log_2 N$ steps. E.g., for 32 toys: Linear = 32 steps. Binary = $\log_2 32 = 5$ steps.

✅ Assessment and Reflection

• 📝 Ask students to write or discuss: "In your own words, what is a search algorithm?"
• 🔄 Have students compare and contrast the linear search and the "halving" (binary-like) search methods. Which was faster and why?
• 🏠 Ask students to think about where they use search algorithms in their daily lives (e.g., finding a book on a shelf, searching for a show on Netflix).
• 🌟 Extension: Discuss how sorting (organizing the toys) can make searching much more efficient, leading into future lessons on sorting algorithms.