trost@reed.UUCP (?name not found) (07/22/87)
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)