AboutHow we built thisSponsorshipShop
SearchSubscribeDecision ToolsBusiness ModelsFrameworksReading Lists
Privacy PolicyTerms of UseCookie PolicyRefund PolicyAccessibilityDisclaimer

© 2026 Faster Than Normal. All rights reserved.

Faster Than Normal
DecisionsPeopleBusinessesNewsletterSubscribe
Start reading →
  1. Home
  2. Mental models
  3. Binary Search
Computer Science & Algorithms

Binary Search

Model #0662Category: Computer Science & AlgorithmsDepth to apply:
4 min read

On this page

  • Core Idea
  • How to See It
  • How to Use It
  • Founders & Leaders
  • Connected Models
  • One Key Quote
  • Summary & Further Reading

Contents

  1. 1. Core Idea
  2. 2. How to See It
  3. 3. How to Use It
  4. 4. Founders & Leaders
  5. 5. Connected Models
  6. 6. One Key Quote
  7. 7. Summary & Further Reading
·Computer Science & Algorithms
Section 1

Core Idea

Binary search finds a target in a sorted sequence by repeatedly halving the search space: compare to the middle element, then search only the half that can contain the answer. Each step cuts possibilities in half, so the number of steps grows logarithmically with size. The same idea applies whenever you can repeatedly ask a yes/no question that eliminates half the options — debugging, pricing, calibration, or search in ordered space.
Section 2

How to See It

Engineering
You're seeing Binary Search when a bug is isolated by repeatedly splitting the system (e.g. "before or after this commit?") or when a sorted structure (array, B-tree) is queried by comparing to the middle and recursing left or right.
Decisions
You're seeing Binary Search when someone finds a threshold (price, dosage, deadline) by testing the midpoint and then the midpoint of the remaining range — "too high or too low?" — until the right value is pinned down.
Section 3

How to Use It

When the space of options is ordered and you can ask a binary question (above/below, yes/no), halve the space each time. Use it for search in sorted data, for finding a threshold (e.g. max price that converts), or for isolating a failure (bisect in time or in components).
Decision filter
"Can we order the options and ask one question that eliminates half? If yes, we're in binary-search territory: keep halving until we're done. If no, we need a different strategy."
As a founder
Use binary search to find pricing (test midpoints; adjust up or down), to isolate the cause of a regression (bisect commits or features), and to narrow product or segment (which half of the market responds?). Requires a clear ordering and a cheap way to test "which half?"
Section 5

Founders & Leaders

Ed ThorpMathematician; author, Beat the Dealer; quantitative investor
Thorp used systematic search and halving of possibility spaces in card counting and in quantitative finance. The discipline — narrow the space with each observation, avoid exhaustive search — is binary search in spirit. Founders can apply it to pricing experiments, A/B sequencing, and root-cause isolation: one clear question per step, halve the space, repeat.
Section 7

Connected Models

Reinforces
Divide and Conquer
Binary search is divide and conquer with a single half kept each time. Split the problem, recurse on the relevant part, combine (here: just return the found element). Same algorithmic mindset.
Tension
Explore-exploit Tradeoff
Binary search assumes a single target and exploits structure. Explore-exploit is about balancing trying new options vs. exploiting the best so far. The tension: binary search is pure exploit of order; use it when the space is ordered and the goal is to find, not to explore widely.
Leads-to
Threshold Rule
Finding a threshold (e.g. minimum viable price, maximum tolerable latency) by repeated "above or below?" is binary search. The threshold rule is the decision version: set a cutoff and act on one side; binary search is how you find that cutoff efficiently.
Section 8

One Key Quote

"Binary search is the first algorithm that every programmer should get right. It's deceptively simple; getting the invariants right matters."
— Jon Bentley, Programming Pearls (1986)
Section 11

Summary & Further Reading

Binary search finds a target in ordered space by repeatedly halving the search range. Use it for sorted data, for finding thresholds (price, latency), and for isolating causes (bisect). The key is an ordering and a binary test that eliminates half the options each step.
01
Programming Pearls — Jon Bentley (1986)
Book
Classic treatment of binary search, invariants, and correct implementation.
02
Introduction to Algorithms — CLRS (2009)
Book
Canonical reference for binary search and divide-and-conquer analysis.
03
Algorithms to Live By — Christian & Griffiths (2016)
Book
Applies binary-search thinking to decision-making, search, and stopping rules.

Why this matters next

mental modelsFirst Principles Thinking

Binary Search applied the First Principles Thinking mental model

mental modelsExplore-exploit Tradeoff

Binary Search applied the Explore-exploit Tradeoff mental model

mental modelsBinary Search

Binary Search applied the Binary Search mental model

mental modelsEfficiency vs Effectiveness

Binary Search applied the Efficiency vs Effectiveness mental model

mental modelsAlgorithms

Binary Search applied the Algorithms mental model

mental modelsThreshold Rule

Binary Search applied the Threshold Rule mental model

Frequently asked questions

What is Binary Search?+

Binary Search is a mental model used for better thinking and decision-making.

How do you apply Binary Search?+

To apply Binary Search, identify situations where this framework is relevant, then use it as a lens to evaluate your options and decisions. The model is most useful when combined with other complementary mental models.

What category does Binary Search fall under?+

Binary Search falls under the Computer Science & Algorithms category of mental models. Other models in this category can be found on the Computer Science & Algorithms hub page.

Why is Binary Search important?+

Binary Search is important because it provides a structured way to think about problems that would otherwise be approached with intuition alone. Understanding this model helps you avoid common reasoning errors and make better decisions.

Continue exploring

AB

Mental model

Abstraction

The practice of hiding complexity behind a simpler interface, enabling reasoning

ET

Mental model

Explore-exploit Tradeoff

The fundamental tension between gathering new information (exploring) and levera

ML

Mental model

Metcalfe's Law

The value of a network grows proportionally to the square of the number of its u

ML

Mental model

Moore's Law

The observation that transistor counts on integrated circuits double roughly eve

MM

Mental model

Mythical Man Month

Brooks's Law: adding people to a late software project makes it later due to com

TD

Mental model

Technical Debt

The accumulated cost of expedient decisions in software and systems that must ev

More like this, in your inbox

I send a newsletter every week — free, no spam, unsubscribe anytime.

Or open the full subscribe page.

On this page

  • Core Idea
  • How to See It
  • How to Use It
  • Founders & Leaders
  • Connected Models
  • One Key Quote
  • Summary & Further Reading

Popular Mental Models

First Principles ThinkingOccam's RazorCircle of CompetenceInversionConfirmation BiasSecond-Order ThinkingDunning-Kruger EffectSurvivorship BiasPareto PrincipleOpportunity Cost