How Binary Search Works

An animation showing binary search on a sorted list, highlighting the midpoint at each step and eliminating half of the remaining elements based on a comparison with the target value. The visual tracks the shrinking search range with pointers for low, high, and mid, making clear why the algorithm runs in logarithmic time. Useful for students learning algorithm design and complexity, and for teachers introducing divide-and-conquer strategies.

16:9 · Preview before teaching · automatic layout checks do not establish subject accuracy

The prompt that made it

Please show how binary search works please

Make your own version

Make the next one in this series

• Compare binary search to linear search using a side-by-side speed race on the same array
• Show how binary search fails on an unsorted array and why sorting is required first
• Illustrate recursive binary search with a call stack diagram alongside the array

Related animations

How A Perceptron Makes A Decision

This animation visualizes a single perceptron processing weighted inputs, summing them with a bias, and passin…

From logic gates to arithmetic: the half adder

This animation shows how a half adder circuit uses an XOR gate to compute the sum bit and an AND gate to compu…

Minimum spanning tree with Kruskal's algorithm

A weighted graph is processed by sorting all edges from cheapest to most expensive, adding each one only if it…

Fibonacci: the recursion tree repeats work; memoisation removes it

This animation draws the full recursion tree for fib(5), showing all 15 calls and highlighting the repeated su…

Recursion on the call stack: 5! unwinds

This animation visualizes fact(5) as it pushes five stacked frames, one for each recursive call, until reachin…

Binary search tree: smaller left, larger right

Values 50, 30, 70, 20, 40, 60, 80, and 35 are inserted one at a time into a binary search tree, with each comp…