logo Practice-It logo


Language/Type: Java merge sort sorting
Author: Robert Baxter

Trace the complete execution of the merge sort algorithm when called on the array below, similarly to the example trave of merge sort shown in the lecture slides. Show the sub-arrays that are created by the algorithm and show the merging of sub-arrays into larger sorted arrays.

int[] numbers = {15, 56, 24, 5, 39, -4, 27, 10};

Make sure to format your answers with each sub-array surrounded by { } braces, such as {1, 2} {3, 4}.

1st split
2nd split
3rd split
1st merge
2nd merge
3rd merge

You must log in before you can solve this problem.

Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.