Sequence 5 — Fundamental Algorithms
Flowcharts, pseudocode, linear search, binary search, bubble sort, insertion sort and algorithm efficiency. Develops algorithmic thinking ahead of advanced algorithms in Year 13. AQA 4.3, Lessons 22–29.
Introduction to Algorithms
- Define an algorithm
- Explain the characteristics of an effective algorithm
Lesson ready
Flowcharts
- Recognise standard flowchart symbols
- Construct flowcharts incorporating sequence, selection and iteration
Lesson ready
Pseudocode
- Write algorithms using AQA-style pseudocode
- Translate pseudocode into Python
Lesson ready
Linear Search
- Explain how linear search operates
- Trace linear search algorithms
Lesson ready
Binary Search
- Explain the binary search algorithm
- Trace binary searches
Lesson ready
Bubble Sort
- Explain bubble sort
- Trace bubble sort algorithms
Lesson ready
Insertion Sort
- Explain insertion sort
- Trace insertion sort algorithms
Lesson ready
Algorithm Performance
- Compare searching algorithms
- Compare sorting algorithms
Lesson ready