ConceptSystems & CS
Bubble sort optimization
Bubble sort can be optimized by terminating early if a full pass through the list results in no swaps, yielding a best-case running time of ́́́.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.