AQA 7517 4.3.5.1: Bubble sort
The free BugBot lesson that teach this point, a robot to try it on, and the past-paper questions that test it.
What it covers
At GCSE (F5.7 and F5.8) you learned how bubble sort and insertion sort work and ran them on the robot's tunes and readings. At A level you need to write them in pseudocode, trace them pass by pass, and analyse them: how many comparisons in the best and worst case, how much memory, and which data each suits.
- Bubble sort
- Hear the passes
- Insertion sort
- Choosing between them
Or do it in the simulator, with tasks that mark themselves
Lessons that teach it
- A5.4 Bubble sort and insertion sort Algorithms and complexity
Tracing passes and insertions, counting comparisons in the best and worst case, in-place sorting and stability.
Try it on a robot
The task from A5.4 Bubble sort and insertion sort, running here. Change the program and press Run.
The specification is AQA's own document; this page says which of our lessons teach point 4.3.5.1 and is not endorsed by the board.