Year 10 - Computing
Insertion 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 use an insertion sort to sort a list containing sample data.
Key Notes
- 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.
Vocabulary To Learn
- 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 Mistakes To Avoid
- An insertion sort is slower than other sorting algorithms.
3 Quick Questions (With Answers)
1. Describe the system or process from this lesson in clear steps.
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.
2. Define this computing term and give one practical example. 'insertion sort'
a sorting algorithm that progressively evaluates items in a list and inserts them into the correct place in an ordered sublist. Add one real device or system example to prove understanding.
3. Correct this common computing misconception.
Mistake: An insertion sort is slower than other sorting algorithms. Correction: 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.
More Lessons In This Unit
Browse all guides in the Year 10 Computing guide library.