Im working on an assigment that involves performing a merge sort on a linked list. Im having real trouble understanding not only what code to put down but also how the theory behind it works. What I mean is, I understand mergesort but not how to apply it to linked lists very well.
This is what I have so far. Im working on trying to split the list into 2 halves atm.