Merging of two sorted halfs without extra memory?

The best answer I've found, assuming you can't use any auxiliary memory, is to heapsort the array, which is theta(n log n), somewhat faster than your current insertion sort scheme.

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.