Question

71 81 77 15 63 96 36 51 77 18 17

Show the contents of the array above each time a Merge Sort changes it while sorting the array into ascending order. Please explain your work and your answer.

Answer 1

Answer:

The result of the merge sort is [15, 17, 18, 36, 51, 63, 71, 77, 77, 81, 96]

Explanation:

Merge sort divides and compares a data structure to sort its items. The sorting algorithm was first implemented by John von Neumann in 1945.

The merge sort steps for the array in the question is in the diagram below.