Share
Explore BrainMass

Merge Sort : splitting and merging trees

Sort the given sequence of numbers using merge sort. Draw the splitting and merging trees for each application of the procedure.

-1, 0, 2, -2, 3, 6, -3, 5, 1, 4

Solution Preview

The resultant sorted sequence will be

-3, -2, -1, 0, 1, 2, 3, 4, 5, 6

Attachment 131206.doc ...

Solution Summary

Solution illustrates the splitting and merging trees obtained in the process of merge sorting the given sequence of numbers, apart from giving the sorted sequence.

$2.19