Binary search

Term Check

Jump to a topic

See every item in the sequence

Definition

A search on a SORTED list that checks the middle item and discards half the list each time (a divide and conquer method).

Example: Binary search needs sorted data; each step halves the search space.

Check this one: Not named in the syllabus; it appears in past SDD questions.

Found in: past SDD papers.

Where you'll use it in the test

Syllabus area: Y11 Programming Fundamentals.

Question types it can appear in

Multiple choice: Pick the option that matches the definition or example.
Code reading: Code or algorithm reading: interpret a fragment and state its output or purpose.
Pseudocode: Use it correctly in the exam pseudocode editor.
Short answer: Define, outline or explain it and tie it to the scenario.

Where it has appeared in the paper

The Software Engineering Project (Part D). Part letters follow each paper’s own layout.

How to use it

A model sentence

General advice, built from the definition and example above

“A search on a SORTED list that checks the middle item and discards half the list each time (a divide and conquer method).” Then apply it: Binary search needs sorted data; each step halves the search space.

In a short answer, give the definition in your own words first, then tie it to the situation in the question. Do not copy the example above unless it fits the scenario.

Command words used with it

General advice

No linked question shows the command word for this term. Across the past pseudocode and short answer questions in this bank the words used most are: Explain, Outline, Describe, Compare, Classify, Analyse. Check the actual word in your question.

Go deeper

Flashcard: Binary search in Programming Fundamentals (Year 11) · study that set
Memorise: Software development steps and algorithm design
Master answer: sdd2021-q28 (5 marks, short answer / extended) (Master model answers: The Software Engineering Project (written answers))
Notes: Part 3. Where this has been examined (see ../../question_bank.md) (The Software Engineering Project (Year 12))
Notes: Software development steps and algorithm design (Year 11 content (Programming fundamentals, OOP, Mechatronics))
Notes: Data structures (Year 11 content (Programming fundamentals, OOP, Mechatronics))
Full term page: every question, note and marking comment for Binary search

Check yourself

Explain “Binary search” in one sentence, give an example, and name a question type that could test it.

Reveal the answer

A search on a SORTED list that checks the middle item and discards half the list each time (a divide and conquer method).

Example: Binary search needs sorted data; each step halves the search space.

Could be tested as: Multiple choice, Code reading, Pseudocode, Short answer.

Quick multiple choice

Binary search can only be used when the list is:

Shorter than 10 items
Made of strings
Sorted
Unsorted

Show the answer

Binary search repeatedly halves a sorted list. Linear search works on any list.

Source: original (written for this study pack; not a NESA question). Open it in the multiple-choice bank.