Learning Experience

Binary Search

Find a value in a sorted collection in O(log n) by repeatedly halving the search space.

Computer ScienceBeginner6 min readalgorithmssearchingdivide-and-conquer

Your learning journey

Every module Axiom offers for binary search — work through them in order, or jump to what you need.

0 of 5 complete0%

Explains what binary search is, why it needs sorted input, and when to reach for it.

Builds intuition by animating low/high/mid pointers narrowing on a target, run after run.

Checks the core precondition (sorted input) is understood before moving on.

Answers follow-up questions and adapts the explanation to the learner's level.

One-glance recall of the invariant, the overflow-safe mid, and the bound variants.

PracticeDeferred

Hands-on implementation drills (rotated arrays, lower/upper bound) — no Practice module type exists yet.

From Axiom's Knowledge Graph.