Loading…
Loading…
GCSE Computer Science · key term
A sorting algorithm that repeatedly compares adjacent items and swaps them if they are in the wrong order.
Used by OCR
Paper 2
Revise: Standard Sorting AlgorithmsBubble sort, insertion sort and merge sort can all start with unsorted data. None requires the input list to be sorted beforehand. They do need a way to compare items consistently, so that the algorithm can decide which item comes before another.
Trace the version of the algorithm you are given: bubble sort may use a fixed number of passes or stop after a pass with no swaps.
Create a free account to read GCSE Computer Science revision notes for your exam board and track your progress.