Series 10
Algorithms
Computational thinking, representing algorithms with pseudocode and flowcharts, searching algorithms, sorting algorithms, and how to evaluate efficiency - every exam board, every topic.
All pseudocode lessons include a board toggle - switch between AQA and OCR syntax. Edexcel & CIE coming soon.
8 Lessons
1
Computational Thinking
Abstraction, decomposition, pattern recognition and algorithmic thinking - the four pillars that underpin every algorithm.
Core concept
No pseudocode
2
Representing Algorithms
Flowchart symbols, pseudocode conventions and how to move between the two notations.
Pseudocode
Flowcharts
AQA / OCR toggle
3
Sequence, Selection and Iteration
The three fundamental building blocks of every algorithm - IF statements, FOR loops and WHILE loops with full worked examples.
Selection
Iteration
AQA / OCR toggle
4
Linear Search
Check every item one by one - how it works, full pseudocode, trace tables, and best/worst/average case analysis.
Searching
Trace table
AQA / OCR toggle
5
Binary Search
Halve the search space each time - the algorithm that only works on sorted data but is far more efficient than linear search.
Searching
Trace table
AQA / OCR toggle
6
Bubble Sort
Compare adjacent pairs and bubble the largest to the end - the sort algorithm examiners ask about most. Full pass-by-pass trace included.
Sorting
Trace table
AQA / OCR toggle
7
Insertion Sort and Merge Sort
Build a sorted portion one element at a time (insertion), or divide and conquer to merge sorted halves (merge). Both with full pseudocode.
Sorting
Divide & conquer
AQA / OCR toggle
8
Comparing and Evaluating Algorithms
Best, worst and average case analysis. When to choose linear vs binary search, and bubble vs insertion vs merge sort.
Efficiency
Comparison
Exam technique
Algorithms Exam Questions
Exam-style questions covering the full series - multiple choice, short answer and extended response, all with mark schemes.
Interactive Tools
Sorting Visualiser
Watch bubble, insertion & merge sort animate
Algorithm Race
Race sorting algorithms head-to-head
Binary Search Tool
Step through binary search interactively
Trace Table
Build trace tables to check algorithm logic
Code to Flowchart
Convert pseudocode into flowchart diagrams
Big-O Visualiser
See how algorithm efficiency scales