Merge sort
What Merge sort means in Computer Science GCSE, as defined for OCR, Pearson Edexcel.
Definitions of Merge sort
Exam boards and our study guides word this term in slightly different ways. Learn the version your board uses.
Check what you remember
Read the wording for your board, then hide it and explain Merge sort in your own words. Rough notes are fine. This is a self-check, with no mark or grade.
Reference: OCR
Splits the list into single items, then repeatedly merges pairs of sorted sublists by comparing their front items until one sorted list remains.
Splits a list into single-item sublists, then repeatedly merges pairs of sorted sublists in order until one sorted list remains.
Topics that use Merge sort
- Searching and sorting algorithms (OCR GCSE)
- Algorithms (Pearson Edexcel GCSE)
Related terms
- Binary search
- Bubble sort
- Linear search
- Arithmetic operators
- Insertion sort
- Logic error
- Logical operators
- Modulus
Using Merge 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.
A week of Premium from your first lesson · Then the free plan continues · No card, no charge