Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site qucis.UUCP
Path: utzoo!utcsri!qucis!levison
From: levison@qucis.UUCP (Mike Levison)
Newsgroups: net.lang.pascal
Subject: Re: Sorting linked lists
Message-ID: <133@qucis.UUCP>
Date: Fri, 11-Apr-86 11:06:34 EST
Article-I.D.: qucis.133
Posted: Fri Apr 11 11:06:34 1986
Date-Received: Sat, 12-Apr-86 06:27:20 EST
References: <7074@tektronix.UUCP>
Organization: Queen's University, Kingston, Ontario
Lines: 11

An algorithm for sorting items stored in linked lists will
be found in:

     Motzkin, D.  "A Stable Quicksort", Software: Practice
and Experience, Vol. 11, pp 607-611, 1981.

As the title suggests, the algorithm is basically Quicksort,
but with a different partition step, in which the list is
scanned sequentially from its beginning to its original end,
and items greater than the pivot are unlinked and attached 
to the end.