Tushar Goel wrote:merge sort basically divides an array in 2 parts and then first sort them individually then merge both of them.
Stephan van Hulst wrote:I think the original question is about using an "in-place merge sort"...
Aron Silvester wrote:In my book it says that "Imagine that you have two distinct arrays that are sorted. Merging two sorted arrays is not difficult, but it does require an additional array". Then I was browsing some forum and someone said, "If two arrays contains suffiecient space for sorting additional data then does not require an additional array for merge the two arrays."
If we had the name of the book and page number, it might be easier to understand.
Les Morgan wrote:. . . Bottom line is, I'm confused. Can someone shed light to this???
Les Morgan wrote:Bottom line is, I'm confused. Can someone shed light to this???