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
Last edited by JoshR; 06-02-2005 at 06:59 PM.
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.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
Thanks a lot Salem
