Question

I have to create a method that does a Merge Sort on a Singly-Linked List. The thing is, the method must be void and take in a LIST (not a node/head) as the argument...obviously can make other methods to use within it...but ultimately thats what it has to be. Anyone interested in helping?? Thanks so much!!

Answer 1

The void return isn't a problem if the list is passed as a pointer or reference, you just sort it, it belongs to the calling scope, and return. The list would just be a pointer to the root node where the list starts.

After that, it's merge sort and tracking pointers.