A program stores the following list of eight integers. The numbers need sorting into ascending order using a merge sort.
| 15 | -42 | 88 | 0 | -2 | 61 | -11 | 34 |
The first step is to divide the list into individual lists of size one. This has been done for you below:
[15] [-42] [88] [0] [-2] [61] [-11] [34]
Complete the merge sort of the data by showing each step of the merging process.
Practise OCR GCSE Computer Science Searching and sorting algorithms with exam-style questions for GCSE Computer Science. 36 questions, matched to the OCR GCSE Computer Science (J277) specification and written in Component 01 and Component 02 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.