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 · every frame verified for overlaps, spacing and edges before rendering

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

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…

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…

Hash tables: a formula decides where each key lives

Seven buckets receive keys according to key mod 7, with collisions stacked as chains beneath each bucket. A lo…

Big-O: how running time grows with the input

This animation plots O(1), O(log n), O(n), O(n log n), O(n^2), and O(2^n) on shared axes, showing how each cur…

Linear search vs binary search: count the comparisons

This animation compares two ways to find the value 51 in a sorted list of 16 numbers. Linear search checks eac…

Quicksort: pick a pivot, partition, recurse

This animation walks through the Lomuto partition method used in quicksort, choosing the last element as pivot…