ConceptSystems & CS
Bubble sort
A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
1Connections
9The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Conditionals
- List
- Loop
- Bubble sort optimization
- Bubble sort pseudo code
- Bubble sort running time analysis