Home My space log
Language EN (English)

The Great Number Hunt (Sorted)

ages 8-10 45 minestimate Screen-free lesson

Pairs play the same hunt game, but this time the numbers are in order, and they discover binary search.

Steps

  1. Ask: is it easier to find a book in a library if the books are in alphabetical order?
  2. Pairs sit back to back with a sheet of 31 sorted boxes.
  3. One partner picks a number that the other must find. Guess the middle box first.
  4. After each guess, the partner says higher or lower. Discard half the boxes every time.
  5. Count guesses and add them to the class chart.
  6. Compare this chart with the unsorted one.

Talk about it

  • How many guesses did it take at most?
  • Why is guessing the middle smart?
  • Could this work for billions of items?

CC BY-SA 4.0

Adapted from CS Unplugged by the University of Canterbury Computer Science Education Research Group (CS Unplugged), licensed CC BY-SA 4.0.

Original lesson, with pictures · License: CC BY-SA 4.0

There are no pictures here. The original lesson has the pictures and printables.

Changes made: Simplified, shortened and translated by Open Cosmos with AI

This adapted lesson is shared under the same license (CC BY-SA 4.0).