Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!seismo!columbia!rutgers!ucla-cs!zen!ucbvax!decvax!tektronix!reed!trost
From: trost@reed.UUCP (?name not found)
Newsgroups: comp.lang.misc
Subject: sorting a linked list
Message-ID: <6659@reed.UUCP>
Date: Wed, 22-Jul-87 11:51:04 EDT
Article-I.D.: reed.6659
Posted: Wed Jul 22 11:51:04 1987
Date-Received: Sat, 25-Jul-87 01:46:57 EDT
Organization: Reed College, Portland OR
Lines: 9
Posting-Front-End: GNU Emacs 18.44.3 of Thu Jul  2 1987 on reed (berkeley-unix)



Somewhere I read a discussion of a sort called the "unshuffle" sort
that was allegedly optimized for linked lists.  Could anyone out there
describe the algorithim used for this sort?  I would really appreciate
it.
-- 
Bill Trost, ...!tektronix!reed!trost
	"ACK!"
	(quoted, without permission, from Bloom County)