Year 10 - Computing
Bubble sort
Searching and sorting algorithms
Study Hub
Study Guides
This pupil-friendly study guide includes a unit summary, clear notes, common mistakes, and quick questions with answers.
Unit Summary
In this unit pupils will have opportunities to analyse, interpret, modify, and implement a range of searching and sorting algorithms. They will have the opportunity to compare the features and efficiency of these algorithms and make suggestions about the most suitable algorithm for a given task.
Lesson Summary
You will learn to perform a bubble sort to order data in a list.
Key Notes
- The bubble sort algorithm works by repeatedly going through a list.
- It compares adjacent items and swaps the items if they are in the wrong order.
- Each time the algorithm goes through the list it is called a pass.
- The pass through the list is repeated until no more changes are made on a pass.
Vocabulary To Learn
- bubble sort: a sorting algorithm that repeatedly compares pairs of values within a list and swaps them if they are out of order
- pass: a complete traversal of a list
Common Mistakes To Avoid
- The bubble sort algorithm stops on the last swap.
3 Quick Questions (With Answers)
1. Describe the system or process from this lesson in clear steps.
The bubble sort algorithm works by repeatedly going through a list. It compares adjacent items and swaps the items if they are in the wrong order.
2. Define this computing term and give one practical example. 'bubble sort'
a sorting algorithm that repeatedly compares pairs of values within a list and swaps them if they are out of order. Add one real device or system example to prove understanding.
3. Correct this common computing misconception.
Mistake: The bubble sort algorithm stops on the last swap. Correction: The pass through the list is repeated until no more changes are made on a pass. The last pass is needed to confirm the data is in order.
More Lessons In This Unit
Browse all guides in the Year 10 Computing guide library.