Loading…
Loading…
GCSE Computer Science · key term
A searching algorithm that compares the target with the middle item of a sorted search range, then repeatedly searches only the half that could contain the target.
Used by OCR
Paper 2
Revise: Standard Searching AlgorithmsLinear search and binary search approach this task differently. Linear search checks items one after another. Binary search uses the order of the data to rule out large groups of items at once.
For binary search, check that the data is sorted and follow the middle-index calculation in the supplied code. With an even number of items, different implementations may choose different middle items.
Create a free account to read GCSE Computer Science revision notes for your exam board and track your progress.