‹
EXPLORE · LISTEN · DISCOVER

Binary Search Halves a Sorted List

Technology · AlgorithmsVISUAL DISCOVERY 97 OF 1,100

Binary Search Halves a Sorted List

Builder · about 6 minutes · a little curiosity goes a long way

Lesson details
Browse all adventures
For grown-ups
Today’s little discovery

On a sorted list, comparing with the middle tells which half can be discarded. Repeating finds the target or proves it absent.

Ask “what changed first?” and “what changed because of it?” Let the child use the arrows and readout as evidence.

This is a learning model. Try the take-home activity together.
Voice settings

Using Heart (en-US).

Saved voices download ahead of play for this activity. No lesson text is sent to a speech service.The sample plays once and does not change the Sound on/off setting.
Your adventure steps
  1. Wonder
  2. Guess
  3. Try it
  4. Discover
  5. Celebrate
01 / 05
13579111315probe 7: keep right half
A little wonder
HERE’S A LITTLE WONDER…

Why must binary search begin with sorted data?

A librarian checks the middle label, then discards the impossible half.

No rush. Try an idea and see.
Try it

Open Lesson to read the question, choose your idea, and continue.