Sorting a double linked list

[PhilB]

I have been having issues trying to merge sort a double linked list. (I would supply the code, but it is locked away on an inaccessable computer.) The list always results in an unsorted list, but no errors. I think I have tracked it down to the recursive functions locking on a node and then the node being moved during the sorting process.

I used an example which sorts an array, so I had to make some guesses on interfacing it with a linked list. Im not too experianced sorting methods beyond a basic bubble sort, so its probably something obvious I am missing.

If possible, might anyone to have a generic model of a merge sort for linked lists?

Phil

[lalchandra]

before moving the node you have to link the node before it to the one that follows and the one that follows it to the node before it.

be sure to declare a pointer to the node that you want to move