Hey guys, I was wondering if anyone could give me a clue on how to start programming a MergeSort function for linked lists (nodes with pointers to next node etc...) If someone could maybe provide some pseudocode, just to start me off, or any advice would help. I have already written a MergeSort function for an array of numbers but I'm stuck on a function for Linked Lists.
Thanks,
Josh