Re: In-place algorithm

Juha Nieminen wrote:
Stephen Howe wrote:

If you are talking about linked lists, then the links themselves
can be manipulated, no auxilary memory is required.

I think that's only possible with doubly-linked lists, but not
with singly-linked ones (not in O(nlogn) anyways).

Yes, singly-linked lists are easily merge-sorted. I posted the
code to do so this morning, long before your posting.

--
[mail]: Chuck F (cbfalconer at maineline dot net)
[page]: <http://cbfalconer.home.att.net>
Try the download section.

** Posted from http://www.teranews.com **
.