Skip to content
Toggle sidebar
Pricing
Log in
Sign up free
Loading…
Home
Subjects
Past papers
Key terms
Pricing
My courses
Select your courses
Loading…
Loading…
Bubble Sort — AQA GCSE Computer Science 8525
Home
More
Computer Science
AQA GCSE Computer Science
Fundamentals of algorithms
Sorting algorithms
Bubble Sort
AQA GCSE Computer Science · 8525
Bubble Sort
What you need to know
Describe the step-by-step mechanics of the bubble sort algorithm.
Explain how bubble sort repeatedly steps through a list, compares adjacent elements, and swaps them if they are in the wrong order.
Revision notes
1
Bubble Sort
4 key terms
Practise with past papers
Key terms & definitions
Previous subtopic
Merge Sort
Next subtopic
Merge Sort vs Bubble Sort
