Bubble sort
Lesson details
Learning outcome
I can perform a bubble sort to order data in a list.
Key learning points
- 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.
Keywords
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 misconception
The bubble sort algorithm stops on the last swap.
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.
Teacher tip
Bubble sort is so named as it is analogous to a bubble passing over and comparing pairs of data. Finding ways to compare the operation of abstract concepts found in computing can help pupils contextualise what they are learning about when the concept is difficult to grasp.
Licence
Lesson video
Loading...
Prior knowledge starter quiz
6 Questions
Q1.What is an algorithm?
Q2.Which searching algorithm is simpler to code?
Q3.What is the purpose of a trace table?
Q4.Which of the following is a characteristic of a binary search?
Q5.What does a linear search do?
Q6.What is required for binary search?
Assessment exit quiz
6 Questions
Q1.Which sorting algorithm repeatedly compares and swaps adjacent items in a list?
Q2.What does the bubble sort algorithm do?
Q3.What is the purpose of swapping items in the bubble sort algorithm?
Q4.How many passes are required to complete a bubble sort?
Q5.Arrange the steps to perform one pass of a bubble sort:
Q6.Match the actions to their purposes:
compares all adjacent items in the list
ensures the list is ordered
fully sorts the list
indicates no swaps were needed
To help you plan your 10 computer science lesson on: Bubble sort, download all teaching resources for free and adapt to suit your pupils' needs...
To help you plan your 10 computer science lesson on: Bubble sort, download all teaching resources for free and adapt to suit your pupils' needs.
The starter quiz will activate and check your pupils' prior knowledge, with versions available both with and without answers in PDF format.
We use learning cycles to break down learning into key concepts or ideas linked to the learning outcome. Each learning cycle features explanations with checks for understanding and practice tasks with feedback. All of this is found in our slide decks, ready for you to download and edit. The practice tasks are also available as printable worksheets and some lessons have additional materials with extra material you might need for teaching the lesson.
The assessment exit quiz will test your pupils' understanding of the key learning points.
Our video is a tool for planning, showing how other teachers might teach the lesson, offering helpful tips, modelled explanations and inspiration for your own delivery in the classroom. Plus, you can set it as homework or revision for pupils and keep their learning on track by sharing an online pupil version of this lesson.
Explore more key stage 4 computer science lessons from the Searching and sorting algorithms unit, dive into the full secondary computer science curriculum, or learn more about lesson planning.