Important Notice:

Practice-It will be discontinued as of November 1st, 2024. After this date, the website will remain online for a transitional period, but login will be restricted to University of Washington NetID authentication. This marks the next phase towards the platform's full retirement. Thank you for your use and support of the application over the years.

If you are looking for an alternative, a similar tool, CodeStepByStep, was developed independently by the original author of Practice-It, and is available at codestepbystep.com**

logo Practice-It logo

mergeSort

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 = {8, 5, -9, 14, 0, -1, -7, 3};
mergeSort(numbers);
s

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.