Linked Lists + MergeSort....(how?)

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

If anyone could help me out that would be great. I just want a quick answer, nothing too long. Just a pointer or a tip, so I can come up with my own implementation.

Thanks,
Josh

http://www.nist.gov/dads/HTML/mergesort.html
All sorts of sorts :)
And plenty of other useful information as well.

Thanks a lot Salem :)

http://cboard.cprogramming.com/showthread.php?t=54127