Explain how the merge sort algorithm works. Refer to the list of numbers [35, 12, 48, 22] in your explanation to illustrate the steps involved.
![A diagram showing a list of four unsorted numbers [35, 12, 48, 22] at the top level, branching downwards into individual sub-lists, and then merging back up into a sorted list [12, 22, 35, 48]](/_next/image?url=https%3A%2F%2Fassets.mathsgenie.co.uk%2Faqa-qb%2Ffbb3b64c-3993-4c72-b804-e931c7725ed5.png&w=3840&q=75)
Sorting algorithms Questions
Practise AQA GCSE Computer Science Sorting algorithms with exam-style questions for GCSE Computer Science. 62 questions, matched to the AQA GCSE Computer Science (8525) specification and written in Paper 1 and Paper 2 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.