logo CodeStepByStep logo


Language/Type: Python merge sort sorting
Related Links:

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

# index     0   1  2   3   4   5   6   7
numbers = [29, 17, 3, 94, 46,  8, -4, 12]

Format your answers with each sub-list 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

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.