Sorting Algorithms – Bubble and Merge (AQA A-Level Computer Science): Flashcards

Arranging data in a specific sequence/order

Compares adjacent elements, swaps if in wrong order

Larger values 'bubble up' to one end

Largest value moves to correct position at end

Tracks if swaps occurred; allows early termination

Divide & conquer: split to singles, merge back sorted

When a subroutine calls itself

Repeatedly halves lists, reducing comparisons needed

Bubble works in-place; merge needs extra memory

Bubble: small/limited memory; Merge: large data