Bubble Sort (OCR A-Level Computer Science): Flashcards

Repeatedly compares adjacent elements & swaps if wrong order

One complete iteration through the list

Maintains relative order of equal elements

Requires small, constant extra memory

$O(n)$

$O(n²)$

$O(n²)$

Optimise & avoid unnecessary passes when list sorted

When list is already sorted

When list sorted in reverse order

Repeatedly swapping adjacent elements until sorted

Not practical - inefficient