Explain how the merge sort algorithm operates to sort a list of data, such as the one shown in Figure 1.
![Diagram showing the merge sort process on a list of four numbers: [85, 24, 63, 45]. Step 1 shows the list split into [85, 24] and [63, 45]. Step 2 shows them split into individual elements: [85], [24], [63], and [45]. Step 3 shows the elements merged into sorted pairs: [24, 85] and [45, 63]. Step 4 shows the final merged and sorted list: [24, 45, 63, 85].](/_next/image?url=https%3A%2F%2Fassets.mathsgenie.co.uk%2Faqa-qb%2Ff2e76853-8642-41be-aeea-9811d9fa3721.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.