Question 1
1 markWhich one of the following statements about a merge sort is true?
Choose your answer.
- It needs extra memory to store the sub-lists
- It can only sort lists with an even number of items
- It swaps neighbouring items until a pass makes no swaps
- It is slower than a bubble sort for large lists
Model answer
It needs extra memory to store the sub-lists
Explanation
A merge sort builds new sub-lists as it splits and merges, so it uses more memory than a bubble sort. It works on lists of any length, because an odd-length list just splits into unequal halves. Swapping neighbours until a pass makes no swaps describes a bubble sort, and a merge sort is faster, not slower, for large lists.
Mark scheme
-
1 mark
It needs extra memory to store the sub-lists
If more than one option is given, 0 marks. Mark is for AO1 (understanding).