I need to sort through a linked list node consisting of an Integer and a pointer to the next Node without moving the elements themselves but by rearranging the pointers I haven't found a way to do this in any textbooks and have no idea where to start can anyone out there help?
Do you want to sort a completely unsorted list, or insert a new node?
to insert a node, just find the node that is before the new node, and the one after, by running through the list until you find that the node is greater than the new node. then update the pointers of the previous node to the new nodes position, and set the new node's pointer to the previous nodes old pointer value.
if you need to sort a completely unsorted list, you'll have to use a recursive algorithm to check each node, until you find the next one, then set that nodes position to the last nodes pointer.
What you, summed up, have to do is just work through the linked list and then test with an if-else statement and the insert if 'x'<'y'. If you would like code, I will be more than happy to give it, but it is quite lengthy so tell me if you want it.
--Garfield
1978 Silver Anniversary Corvette
