Re: Sorting linked lists

Article View: net.lang.pascal

Article #284

#284

From: Mike Levison
Date: Fri, 11 Apr 1986 16:06

11 lines
963 bytes

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.

Technical Details

Message-ID: <133@qucis.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!utcsri!qucis!levison

References: <7074@tektronix.UUCP>

Show Full Headers

Complete Article Headers

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: arc1-ca.pugleaf.net!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

Reply to Parent Message