Can anyone help me with this pratice question: 33 31 11 47 2 20 24 12 2 43. I am trying to figure out what the contents of the two output lists would be after the first pass of the Merge Sort.

The answer is supposedly:
List 1: 33 11 47 12
List 2: 31 2 20 24 2 43

Not making any sense to me sense I was under the impression that the first pass was where it divided it into two lists at the middle....

All mergre sorts I have seen that deal with recusrion use the split in the middle method. Is this a recursive merge sort or are the doing an iterative merge sort?

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.