Watch binary search halve a sorted window each probe — lo/hi/mid pointers, TRUE/FALSE verdicts, live pseudocode, and your own numbers.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Binary Search Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Watch binary search halve a sorted window each probe — lo/hi/mid pointers, TRUE/FALSE verdicts, live pseudocode, and your own numbers. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Linear Search Visualizer: Watch linear search check each element one by one with a colored TRUE/FALSE verdict per probe, live pseudocode, and step-by-step narration.
Open toolAlgorithm Academy: 35+ classic algorithms animated step by step — searching, counting/radix/bucket sort, dynamic programming tables, greedy, backtracking, KMP, graph algorithms, max flow, and convex hull — with auto-play, next/prev stepping, adjustable interval, and pseudocode that highlights the running line.
Open toolBinary Search Tree Visualizer: Insert, delete, search, and traverse a BST, AVL tree (animated rotations with balance factors), or min-heap — every comparison narrated, every pointer move animated.
Open tool1Binary search needs sorted input — sorted copy shown. Search window is the whole array.
lo, hi = 0, n-1while lo <= hi:mid = (lo + hi) / 2if a[mid] == t: return midif a[mid] < t: lo = mid+1else: hi = mid-1return not-found
Halve a sorted search window each probe. 1,000,000 items need at most 20 probes.
