Bubble Sort Visualised

Part of Binary Search · Section 3 of 9

DiagramUnit: 3.1 Fundamentals of AlgorithmsGCSE

This diagram covers Bubble Sort Visualised within Binary Search for GCSE Computer Science. Revise Binary Search in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 10 flashcards. This is a high-frequency topic, so it is worth revising until the explanation feels precise and repeatable. 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.

Bubble Sort Visualised

Sorting [5, 3, 8, 1] with Bubble Sort Pass 1: 5 3 8 1 → swap 5,3 3 5 1 8 8 bubbled! Pass 2: 3 5 1 8 → swap 5,1 3 1 5 8 5 bubbled! Pass 3: 3 1 5 8 → swap 3,1 1 3 5 8 3 bubbled! SORTED: 1 3 5 8 Key Insight After each pass, the largest unsorted value "bubbles" to its final position. Faded boxes = already in final position (don't need to check again)

Practice questions for Binary Search

Which of the following is a requirement before binary search can be used?

  • A. The list must contain an even number of items
  • B. The list must be sorted in order
  • C. The list must be stored in a 2D array
  • D. The target value must be in the first half of the list
1 markfoundation

Describe how a binary search algorithm finds a target value in a sorted list.

3 marksstandard

Quick recall flashcards

What technique does binary search use?
Divide and conquer - repeatedly halves the search space
What is the time complexity of binary search?
O(log n) - logarithmic time

Previous

Putting Things in Order

Next

Sorting Algorithm Comparison

15 questions on Binary Search — practise free

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

Start revising free →