Write a function to recursively and visually do a merge-sort of a
given array of 20 numbers. Be sure that after each merge the entire contents of the array
are printed to the screen, including the number of merges so far that the
current array arrangement represents.
An example run for 5 numbers would look like:
Enter 5 integers: 5 0 1 4 3
The interim results of the merge_sort algorithm are:
INDEX: 0 1 2 3 4
--------------------
Merge # 1: 5 0 1 4 3
Merge # 2: 0 5 1 4 3
Merge # 3: 0 1 5 4 3
Merge # 4: 0 1 5 3 4
Merge # 5: 0 1 3 4 5
I need it to run for 20 integers and i don't know how to begin. I know to use the merge sort algorithm but thats it.
