Binary search
What Binary search means in Computer Science GCSE, as defined for OCR, Pearson Edexcel.
Definitions of Binary search
Exam boards and our study guides word this term in slightly different ways. Learn the version your board uses.
Check what you remember
Read the wording for your board, then hide it and explain Binary search in your own words. Rough notes are fine. This is a self-check, with no mark or grade.
Reference: OCR
Requires a sorted list, examines the middle item, then discards the half that cannot contain the target and repeats on the remaining half.
Requires a sorted list: examines the middle item, then discards the half that cannot contain the target and repeats on the remaining half.
Topics that use Binary search
- Searching and sorting algorithms (OCR GCSE)
- Algorithms (Pearson Edexcel GCSE)
Related terms
- Bubble sort
- Linear search
- Merge sort
- Arithmetic operators
- Insertion sort
- Logic error
- Logical operators
- Modulus
Using Binary search in the exam
Check the command word and mark scheme for your exact question. After comparing your explanation with the reference, use the term in an answer on the linked topic. This practice does not predict an exam mark.
Practise Computer Science questions
Create a free account to answer exam-style questions on this topic and get feedback on your answers.
A week of Premium from your first lesson · Then the free plan continues · No card, no charge