CS Thinking · Computational Thinking · Grade 9-12 · 5 min read

Binary Search

Q: Does Binary Search always require code?

This concept may use notation such as $$O(\log n)$$ time complexity, but notation should come after recognition. First decide that the problem really calls for an algorithm explanation with input, output, invariant or rule, termination condition, and efficiency tradeoff stated. Then check that every symbol, variable, or term has a meaning in the prompt.

⚡ In one breath

An efficient algorithm for finding a target value in a sorted list by repeatedly halving the search range.

📐 The formula

O(\log n)

time complexity

Orient

The one-line idea, why it matters, and the intuition.

Section 1

Quick Answer

An efficient algorithm for finding a target value in a sorted list by repeatedly halving the search range. At each step, compare the target to the middle element: if equal, the search is done; if smaller, search the left half; if larger, search the right half. In a classroom problem, use binary search when the task asks how a procedure searches, sorts, recurses, divides work, terminates, or scales with input size. The recognition step is: Am I judging the steps of a method for correctness, termination, edge cases, and efficiency as inputs change? Before answering, name the input, process, output, data, user, or system part that the idea controls.

Section 2

Why This Matters

Binary search is orders of magnitude faster than linear search for large sorted datasets. Searching 1 billion sorted items takes at most 30 comparisons with binary search, compared to up to 1 billion with linear search.

Section 3

Intuitive Explanation

Think of Binary Search as a way to make a computing situation inspectable. The model focuses on a repeatable method with inputs, outputs, correctness, and efficiency. It asks what information enters, what process or rule acts on it, what output or decision is expected, and what constraint matters for correctness or responsible use.

students compare two ways to find a name in a list and explain which method uses fewer checks as the list grows. A weak answer repeats a definition or names a familiar tool. A stronger answer traces the situation: what is being represented, what action happens, what evidence would show success, and what edge case or tradeoff could break the solution.

The formula or notation is useful after the model is chosen. It summarizes a relationship, but it cannot decide by itself whether the task is really about binary search.

A good mental check is "Test the method across inputs." If the situation is really about code implementation, one successful test, or data representation, the same words may need a different model. CS thinking becomes easier when students choose the concept from the problem structure instead of from the most familiar word in the prompt.

Core idea

Each comparison eliminates half the remaining possibilities — O(log n) vs O(n) for linear search.

Recognize

The cues that signal this concept and how to distinguish it from look-alikes.

Section 4

When to Use

Use binary search when the task asks how a procedure searches, sorts, recurses, divides work, terminates, or scales with input size. Look for signals such as algorithm, search, sort, recursive, efficient, input size, then verify the structure with this question: Am I judging the steps of a method for correctness, termination, edge cases, and efficiency as inputs change? Do not use it from vocabulary alone; first identify the target, process, output, evidence, and limits.

Pro tip

To perform binary search, set low = 0 and high = length - 1. Compute mid = (low + high) / 2. If the target equals the middle element, you are done. If the target is less, set high = mid - 1. If greater, set low = mid + 1. Repeat until found or low > high.

Section 5

How to Recognize It

Before using Binary Search, ask: does the prompt require you to state the input, rule, output, and stopping point?

Does the prompt give input size, ordered data, repeated steps, base case, and correctness tests, and does it ask you to state the input, rule, output, and stopping point?

Yes means binary search is in play; no means the prompt is probably asking for Searching or another neighboring idea.
Does the requested answer call for output, or is it really about Searching?

Choose Binary Search when the final answer needs state the input, rule, output, and stopping point; choose Searching when the prompt centers on process instead.
Do the given details include input size, ordered data, repeated steps, base case, and correctness tests?

Those details are the evidence for binary search. If they are missing, the concept may be only a vocabulary clue.
Does the prompt's steps match how the definition of Binary Search uses it?

A matching use points toward Binary Search; a different use usually means a sibling concept is closer.
Could a watch-out apply here — for example, the prompt asks about code syntax or user design instead?

If so, reconsider Searching. If not, keep Binary Search and state the specific cue that made it fit.

Section 6

Binary Search vs Searching vs Array vs Algorithm Efficiency

Binary Search, Searching, Array, Algorithm Efficiency get mixed up because they can appear near bisection search and half-interval search. The difference is the final job: Binary Search asks for output, while the other rows point to different cues.

Binary Search vs Searching vs Array vs Algorithm Efficiency
Type	Meaning	Key test	Formula	Example
Binary Search	An efficient algorithm for finding a target value in a sorted list by repeatedly halving the search range.	Use when the prompt asks for output: state the input, rule, output, and stopping point.	$O(\log n)$ time complexity	Find 37 in [1,5,12,23,37,49,56]: check middle (23), go right, check middle (49), go left, find 37.
Searching	The process of locating a specific item or value within a collection of data using a systematic strategy.	Use instead when search algorithm and process is the main cue, not Binary Search.	Searching pattern	Linear search: check each item.
Array	An ordered collection of values stored together under a single name and accessed by their numeric index position.	Use instead when list and collection is the main cue, not Binary Search.	Array pattern	scores = [95, 87, 92].
Algorithm Efficiency	The ratio of useful output energy (or power) to total input energy, expressed as a percentage — always less than 100% due to energy losses.	Use instead when time complexity and big o is the main cue, not Binary Search.	Algorithm Efficiency pattern	$O(n)$ : linear—twice the data, twice the time.

Binary Search

Meaning: An efficient algorithm for finding a target value in a sorted list by repeatedly halving the search range.
Key test: Use when the prompt asks for output: state the input, rule, output, and stopping point.
Formula: $O(\log n)$ time complexity
Example: Find 37 in [1,5,12,23,37,49,56]: check middle (23), go right, check middle (49), go left, find 37.

Searching

Meaning: The process of locating a specific item or value within a collection of data using a systematic strategy.
Key test: Use instead when search algorithm and process is the main cue, not Binary Search.
Formula: Searching pattern
Example: Linear search: check each item.

Array

Meaning: An ordered collection of values stored together under a single name and accessed by their numeric index position.
Key test: Use instead when list and collection is the main cue, not Binary Search.
Formula: Array pattern
Example: scores = [95, 87, 92].

Algorithm Efficiency

Meaning: The ratio of useful output energy (or power) to total input energy, expressed as a percentage — always less than 100% due to energy losses.
Key test: Use instead when time complexity and big o is the main cue, not Binary Search.
Formula: Algorithm Efficiency pattern
Example: $O(n)$ : linear—twice the data, twice the time.

Apply

Worked examples and the mistakes most students make.

Section 7

Formula & Notation

O(\log n)

time complexity

Binary search on sorted array

A[0..n-1]

for target

t

: set

l=0, r=n-1

. While

l \leq r

, compute

m = \lfloor(l+r)/2\rfloor

. If

A[m]=t

, return

m

. If

A[m]<t

, set

l=m+1

. Else set

r=m-1

. Runs in

O(\log n)

time.

Section 8

Worked Examples

Example 1 — Recognize the model

Easy

Problem

A class sees this computing situation: students compare two ways to find a name in a list and explain which method uses fewer checks as the list grows. How should a student decide whether Binary Search is the right model?

Solution

Identify the target of the reasoning.

The target might be a problem, data representation, code state, system component, user need, or stakeholder.
List the process or relationship that matters.

Binary Search is useful when the problem asks for an algorithm explanation with input, output, invariant or rule, termination condition, and efficiency tradeoff stated.
Apply the recognition test: Am I judging the steps of a method for correctness, termination, edge cases, and efficiency as inputs change?

This separates binary search from code implementation and one successful test.
State the evidence that would prove the answer.

A trace, test, diagram, input-output pair, or impact argument prevents a vague answer.

Answer

Use Binary Search only if the task is asking for an algorithm explanation with input, output, invariant or rule, termination condition, and efficiency tradeoff stated and the situation passes the recognition test. Otherwise, choose the nearby model that better matches the computing structure.

Takeaway: Model choice comes before definitions. The same words can belong to different CS ideas depending on the problem structure.

Example 2 — Avoid the vocabulary trap

Standard

Problem

A student says, "This prompt contains the word algorithm, so I should use binary search." Explain why that shortcut is risky.

Solution

Treat the word as a clue, not proof.

CS vocabulary overlaps across problem solving, programming, data, systems, design, and impact questions.
Check whether the target and process match Binary Search.

The computing structure decides the model.
Compare with Code implementation and One successful test.

Code is one expression of an algorithm; the algorithm is the method and its behavior across inputs. Passing one test is not enough; an algorithm must work for all valid inputs and edge cases.
State what the final result would mean.

If the final result would not mean an algorithm explanation with input, output, invariant or rule, termination condition, and efficiency tradeoff stated, the model is probably wrong.

Answer

The shortcut is risky because algorithm can appear in several related CS models. The student must first show that the task answers "Am I judging the steps of a method for correctness, termination, edge cases, and efficiency as inputs change?" with yes.

Takeaway: A CS thinking concept is a reasoning tool, not just a vocabulary match.

Example 3 — Write the computing conclusion

Application

Problem

After solving a Binary Search problem, a student writes only a definition. What should be added to make the answer useful?

Solution

Name the specific case.

The answer should identify the input, data, program state, system component, user, or stakeholder being described.
Show the process or evidence.

A trace, test, example, diagram, or tradeoff explains why the concept applies.
Connect the result to the goal.

The final sentence should say how the concept helps solve, test, design, represent, protect, or evaluate the computing situation.
Mention limits or edge cases.

Computing answers are stronger when they state where the method might fail, scale poorly, exclude users, or require a different design.

Answer

A complete answer should say what binary search controls in the specific situation, include evidence such as a trace or test, and state any condition needed for the model to apply.

Takeaway: The final explanation is part of CS thinking, not an optional sentence after the term.

Section 9

Common Mistakes

Common slip-up

Applying binary search to an unsorted list, which produces incorrect results

The right idea

Fix this by naming the input, process, output, evidence, and checking "Am I judging the steps of a method for correctness, termination, edge cases, and efficiency as inputs change?" before using the concept.

Common slip-up

Computing the midpoint as (low + high) / 2, which can cause integer overflow—use low + (high

The right idea

low) / 2 instead - Fix this by naming the input, process, output, evidence, and checking "Am I judging the steps of a method for correctness, termination, edge cases, and efficiency as inputs change?" before using the concept.

Common slip-up

Getting the boundary updates wrong (using mid instead of mid+1 or mid-1), causing infinite loops

The right idea

Common slip-up

Using binary search from a keyword alone

The right idea

Signal words like algorithm, search, sort only point to a possible model; the computing structure must match too.

Practice

Try it, then see where this concept fits in the path.

Section 10

Mini Practice

Try these on your own. Tap Reveal when you want to check.

What is the first thing to identify before using Binary Search?

Hint: Do not start with the vocabulary word.
Name two clues that suggest Binary Search might apply, and one reason those clues are not enough by themselves.

Hint: Use signal words and structure.
A student confuses Binary Search with Code implementation. What comparison should they make?

Hint: Compare what each model tracks.
What should the final answer include besides a definition?

Hint: Think like a debugger or designer.
Give one condition that would make this NOT a Binary Search situation.

Hint: Use the invalid condition.
Rewrite this weak explanation: "I used Binary Search because that word appeared in the prompt."

Hint: Use the recognition test.

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Practice this concept → Take a mastery check

Section 11

Frequently Asked Questions

What is Binary Search in simple terms?

Binary Search is a CS thinking idea for situations where the task asks how a procedure searches, sorts, recurses, divides work, terminates, or scales with input size. In simple terms, it helps turn a computing situation into an algorithm explanation with input, output, invariant or rule, termination condition, and efficiency tradeoff stated. The useful classroom habit is to say what is being analyzed, what process matters, and what evidence would show the answer is correct.

How do I know when to use Binary Search?

Use binary search when the situation passes this test: Am I judging the steps of a method for correctness, termination, edge cases, and efficiency as inputs change? Also look for clues such as algorithm, search, sort, recursive, efficient, but only after the input, process, output, data, user, or system part is clear. If the prompt changes the case, representation, program state, component, stakeholder, or constraint, recheck the model before answering.

What is the most common mistake with Binary Search?

The common mistake is choosing binary search from a keyword or definition without tracing the computing structure. A safer approach is to name the target, process, evidence, answer form, and limits first. That short setup prevents mixing algorithm reasoning with code tracing, data representation with interface display, or technical features with human impact.

How is Binary Search different from Code implementation?

Binary Search is used when the task asks how a procedure searches, sorts, recurses, divides work, terminates, or scales with input size. Code implementation is different because code is one expression of an algorithm; the algorithm is the method and its behavior across inputs. The difference matters because two prompts can use similar words while asking for different computing evidence.

Does Binary Search always require code?

This concept may use notation such as $O(\log n)$ time complexity, but notation should come after recognition. First decide that the problem really calls for an algorithm explanation with input, output, invariant or rule, termination condition, and efficiency tradeoff stated. Then check that every symbol, variable, or term has a meaning in the prompt.

What should a complete answer include?

A complete answer should include the computing result, the input or case being described, the process or rule used, evidence such as a trace or test when relevant, and a sentence connecting the result to the original goal. If the model assumes a condition, such as valid input, a sorted list, a trusted protocol, enough storage, representative data, or a particular stakeholder need, state that condition too.

Section 12

Learning Path

← Before

Searching Array Algorithm Efficiency

Binary Search

You are here

Linear Search

Before this, students should be comfortable with Searching and Array. This page focuses on the recognition cue: Am I judging the steps of a method for correctness, termination, edge cases, and efficiency as inputs change? That cue connects earlier computing descriptions to later problem solving because students first choose the model, then choose the representation, code, test, diagram, or explanation. After this, Linear Search become easier to recognize.

Section 13