Reversing a singly linked list

[Wilson Gordon]

I am looking for some ideas on how to reverse a singly linked list efficiently.

Thanks in advance.

[Garrett Rowe]

I'm not sure how your linked list is represented internally, but maybe something like this will work:

currentFirstNode = end of list marker
while there are more elements in the list
   get next element 'e' in the list
   link 'e' to currentFirstNode  (e.next = currentFirstNode)
   currentFirstNode = 'e'
end loop

Does that help at all?
[ June 29, 2007: Message edited by: Garrett Rowe ]

[Wilson Gordon]

Thanks Garrett. That looks like a good algorithm!