Mergesort : Revision?

What you described is only merging (without sorting), sorting is done recursivly in merge sort.

A merge sort works by splitting an array in two then calling merge sort on each half. When merge sort is called with only one element it simply returns it. The merging takes place after the recursion and puts the array back together in sorted order.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.