Year 10 - Computing
Merge 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 perform a merge sort to order a list.
Key Notes
- Merge sort splits items in lists into individual lists before merging pairs of lists together till all items are sorted.
- Merge sort is an efficient "divide and conquer" algorithm that can perform well in real world use.
- A merge sort algorithm is usually faster to execute but more complex to write than bubble sort.
- Executing a merge sort takes up extra space in memory.
Vocabulary To Learn
- merge sort: a sorting algorithm that works by repeatedly splitting data into sublists and merging pairs of sublists, ordering the items as they are merged
- splitting: the initial step of dividing an unsorted list into smaller sublists
- merging: the process of combining two already sorted lists into a single, larger sorted list
Common Mistakes To Avoid
- Merge sort is the most efficient sorting algorithm for all cases.
3 Quick Questions (With Answers)
1. Describe the system or process from this lesson in clear steps.
Merge sort splits items in lists into individual lists before merging pairs of lists together till all items are sorted. Merge sort is an efficient "divide and conquer" algorithm that can perform well in real world use.
2. Define this computing term and give one practical example. 'merge sort'
a sorting algorithm that works by repeatedly splitting data into sublists and merging pairs of sublists, ordering the items as they are merged. Add one real device or system example to prove understanding.
3. Correct this common computing misconception.
Mistake: Merge sort is the most efficient sorting algorithm for all cases. Correction: For smaller data sets, simpler algorithms such as insertion sort or bubble sort can be faster due to the overhead in merge sort of having to break apart the data to be sorted.
More Lessons In This Unit
Browse all guides in the Year 10 Computing guide library.