found = False
low = 0
high = numbers.length - 1
while low <= high AND found == False
mid = (low + high) DIV 2
if numbers[mid] == target then
found = True
elseif numbers[mid] < target then
low = mid + 1
else
high = mid - 1
endif
endwhile
This follows OCR reference language. AQA and Edexcel questions use a similar structure with their own pseudocode style.
This study notes covers Deep Dive: Pseudocode within Binary Search for GCSE Computer Science. Revise Binary Search in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 10 flashcards. This is a high-frequency topic, so it is worth revising until the explanation feels precise and repeatable. It is section 5 of 8 in this topic. Use this study notes to connect the idea to the wider topic before moving on to questions and flashcards.
Practice questions for Binary Search
Which of the following is a requirement before binary search can be used?
Describe how a binary search algorithm finds a target value in a sorted list.
Quick recall flashcards
What technique does binary search use?
Divide and conquer - repeatedly halves the search space
What is the time complexity of binary search?
O(log n) - logarithmic time