Computer Science GCSE
Insertion sort
What Insertion sort means in Computer Science GCSE, as defined for OCR.
Definition of Insertion sort
Check what you remember
Read the wording for your board, then hide it and explain Insertion sort in your own words. Rough notes are fine. This is a self-check, with no mark or grade.
Reference: OCR
Builds a sorted section at the start by taking the next item and inserting it into the correct position among those already sorted, shifting larger items right.
Topics that use Insertion sort
- Searching and sorting algorithms (OCR GCSE)
Related terms
- Binary search
- Bubble sort
- Linear search
- Merge sort
- Efficiency of algorithms
- Searching within data structures
Using Insertion sort in the exam
Check the command word and mark scheme for your exact question. After comparing your explanation with the reference, use the term in an answer on the linked topic. This practice does not predict an exam mark.
Practise Computer Science questions
Create a free account to answer exam-style questions on this topic and get feedback on your answers.
Start free
All Computer Science GCSE termsA week of Premium from your first lesson · Then the free plan continues · No card, no charge