PrepWisePrepWiseComputer Science
AlgorithmsLow Exam FrequencyOCR

Bubble Sort

Revise Bubble Sort in Algorithms for GCSE Computer Science with 15 exam-style questions and 10 flashcards. This topic appears less often, but it can still pick up marks when it appears in mixed-topic papers.

Study this topic

1

Video Lesson

Notes2

Reusable Code Blocks

Introduction3

Sorting Algorithms Comparison

Diagram4

Functions vs Procedures

Notes5

Deep Dive: Parameters

Notes6

Deep Dive: Benefits of Subprograms

Notes7

Memory Trick

Notes8

Exam Tips

Notes

Sample 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

Sample Questions

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

15

exam-style questions

10

revision flashcards

Ready to revise Bubble Sort?

Get personalised daily study plans, adaptive quizzes, and spaced repetition flashcards.

Join Alpha

Previous topic

Binary Search

Next topic

Merge Sort