A seismologist is analyzing the arrival times (in seconds past midnight) of P-waves at eight different sensors. The recorded times are:
| 14 | 5 | 23 | 11 | 19 | 8 | 17 | 3 |
To order these times, the seismologist uses a merge sort algorithm.
Complete the table below to show how the merge sort algorithm operates on this list of arrival times.
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:
| 14 | 5 | 23 | 11 | 19 | 8 | 17 | 3 |
|---|
Row 2 (after merging sublists of size 1):
Row 3 (after merging sublists of size 2):
Final sorted array:
| 3 | 5 | 8 | 11 | 14 | 17 | 19 | 23 |
|---|
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.