Jonah wants his star sticker. Bo opens box 1: a leaf. Box 2: a moon. Box 3: a shell. Box 4: a kite.
Box 5 holds the star, so Bo stops.
Boxes 6, 7 and 8 never need opening. Bo opened 5 boxes.
Example 2: Count the boxes
Jonah wants the shell. It is in box 3.
Bo opens box 1, box 2 and box 3, and stops.
He opened 3 boxes.
Example 3: Not in the list
Jonah wants a rocket sticker, and Bo opens every box from one to eight, in order.
None of them holds a rocket.
Every box was checked once, so the rocket is not in the list. Bo opened 8 boxes.
Example 4: Going round in circles
Jonah opens box five, then box two, then box five again.
Opening at random can open one box twice and miss another.
Going in order fixes it.
Words to know
list
Things in a row, like the eight boxes.
search
To look through a list for one thing.
in order
One at a time, from the first.
not in the list
Every box was checked and it was not there.
Watch out
Do not open the same box twice. It wastes time.
Do not jump about at random. You can miss a box.
Do not keep looking after you find it. The search is done.
Do not say it is not there after one box. Check them all first.
Try it
The sticker is in box 6, and Bo goes in order. How many boxes does he open?
Bo opens all 8 boxes and finds no rocket. What does he say?
Should Jonah open the boxes in order, or at random?
Once you find it, do you keep looking?
Answers: 1. 6 · 2. It is not in the list · 3. In order · 4. No, you stop
Try at homeLine up eight cups in a row, numbered with small paper tags. Hide a coin under one. Ask a grown-up to lift the cups one at a time, in order, and stop when they find it. Count how many cups they lifted. Then swap, and hide nothing once. What should they say at the end?
For grown-upsPlay the Mission: line up eight cups in a row with paper number tags and hide a coin under one. Lift the cups one at a time, in order, and stop when you find it, then count how many you lifted. Then swap, and once hide nothing: what should the searcher say at the end?
Open these notes on screenScan the code, or go to tutorpip.com.