IGCSE Computer Science 0478: Linear search and bubble sort
Students learn how linear search and bubble sort work, write each in Cambridge pseudocode and trace them on sample data.
One content description from the full IGCSE Computer Science 0478 — 7d Standard Methods of Solution journey. All 11 modules below are in that journey too, with the same content — add just these to a class, or the whole strand.
Modules (11)
1
Linear search: how it works
2
Linear search with a FOR loop and a Found flag
3
Linear search that stops when the target is found
4
Outputting the result of a linear search
5
Tracing a linear search
6
Bubble sort: how it works
7
Swapping two values with a temporary variable
8
One pass of a bubble sort
9
Bubble sort with nested FOR loops
10
Bubble sort that stops when no swaps are made
11
Tracing a bubble sort
For Teachers
Add this journey to your class and track every student in real time.
Create a free teacher account →No credit card. No setup fee. Make a class and invite students in under three minutes.
For Students
Start this journey on Cloodit — track progress, earn badges, and play live sprints with your class.
Start Learning Free →