Sorting Algorithms Comparison

Part of Bubble Sort · Section 3 of 9

DiagramUnit: 3.1 Fundamentals of AlgorithmsGCSE

This diagram covers Sorting Algorithms Comparison within Bubble Sort for GCSE Computer Science. Revise Bubble Sort in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 16 exam-style questions and 10 flashcards. This topic appears regularly enough that it should still be part of a steady revision cycle. It is section 3 of 9 in this topic. Focus on the labels, the relationships between parts, and the explanation that turns the diagram into an exam-ready answer.

Sorting Algorithms Comparison

Sorting algorithms comparison diagram showing Bubble Sort (compare adjacent pairs, swap if out of order, repeat passes), Merge Sort (divide list in half recursively then merge sorted halves), and Insertion Sort (build sorted portion one element at a time by inserting each element into its correct position), with time complexity labels O(n2) for bubble and insertion, O(n log n) for merge

Practice questions for Bubble Sort

Which of the following best describes bubble sort?

  • A. It selects the smallest element and moves it to the front each pass
  • B. It compares adjacent elements and swaps them if they are in the wrong order
  • C. It divides the list in half repeatedly until each half is sorted
  • D. It inserts each element into its correct position one at a time
1 markfoundation

Describe how bubble sort works. You should refer to what happens during each pass through the list. [3 marks]

3 marksstandard

Quick recall flashcards

How does bubble sort work?
Compare adjacent pairs, swap if wrong order, repeat passes
Why is it called bubble sort?
Largest values bubble up to the end like bubbles rising in water

Previous

Reusable Code Blocks

Next

Functions vs Procedures

16 questions on Bubble Sort — practise free

Instant marking, adaptive difficulty and spaced-repetition flashcards — all aligned to your exam board.

Start revising free →