A LEVEL · H446
OCR A Level
algorithms, in motion.
Watch the logic unfold, then run it with your own numbers. Each lesson has a clear visual trace and optional code view.
On this course
6 syllabus lessons01 / Search
Linear search
Check one value at a time until the target is found or the list ends.
Open animation ↗02 / SearchBinary search
Halve the remaining search range in a sorted list.
Open animation ↗03 / SortBubble sort
Compare neighbours and move the larger value right on each pass.
Open animation ↗04 / SortInsertion sort
Take the next value and insert it into the sorted left side.
Open animation ↗05 / SortMerge sort
Split the list, then merge sorted halves back together.
Open animation ↗06 / SortQuicksort
Partition around a pivot, then sort the smaller ranges.
Open animation ↗Board coverage reflects the linked specification. Pseudocode examples are teaching implementations; always check the exact notation and exam year for your course. View official specification ↗
