Insertion sort
I can use an insertion sort to sort a list containing sample data.
Insertion sort
I can use an insertion sort to sort a list containing sample data.
These resources will be removed by end of Summer Term 2025.
Switch to our new teaching resources now - designed by teachers and leading subject experts, and tested in classrooms.
These resources were created for remote use during the pandemic and are not designed for classroom teaching.
Lesson details
Key learning points
- An insertion sort groups the items of a list into two parts: a sorted sublist and an unsorted sublist.
- An item is taken from the unsorted sublist, compared to the items in the sorted sublist and put in the correct position.
- People often perform an insertion sort when they are putting objects into order, like books or cards.
Keywords
Insertion sort - a sorting algorithm that progressively evaluates items in a list and inserts them into the correct place in an ordered sublist
Sorted sublist - sorted values held in the lower positions of the list
Unsorted sublist - unsorted values held in the higher positions of the list
Common misconception
An insertion sort is slower than other sorting algorithms.
While other algorithms offer better time complexity for large, unsorted arrays, insertion sort can still be faster in practice for smaller and partially sorted lists.
To help you plan your year 10 computer science lesson on: Insertion sort, download all teaching resources for free and adapt to suit your pupils' needs...
To help you plan your year 10 computer science lesson on: Insertion 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.