Complete the table below to show how the merge sort algorithm operates on the given array of numbers.
The first row shows the starting array, and the final row shows the sorted array. Fill in the values for the two intermediate rows showing the steps of the merge process.
Starting array:
| 6 | 2 | 8 | 3 | 5 | 1 | 7 | 4 |
|---|
Row 2 (after merging sublists of size 1):
Row 3 (after merging sublists of size 2):
Final sorted array:
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
|---|
52 exam-style questions on AQA GCSE Computer Science Sorting algorithms. Each one has a worked solution and a mark scheme showing where the marks go.