From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,50880f040eb869b4
X-Google-Attributes: gid103376,public
From: NKSW39B@prodigy.com (Matthew Givens)
Subject: Re: Anyone help develop an algorythm?
Date: 1997/04/23
Message-ID: <5jjtaj$1e9e@newssvr01-int.news.prodigy.com>#1/1
X-Deja-AN: 236707501
Distribution: world
References: <5jddg7$uf0@newssvr01-int.news.prodigy.com>
 <e8yijs.fg1.0.-s@inmet.camb.inmet.com>
Organization: Prodigy Services Company  1-800-PRODIGY
Newsgroups: comp.lang.ada
Date: 1997-04-23T00:00:00+00:00
List-Id: <comp.lang.ada>


stt@houdini.camb.inmet.com (Tucker Taft) wrote:
>
>
>
>There is a variant of quick-sort that works on linked lists.
>The trick is to use the first element in the list as the "pivot" and
>then build up two new linked lists containing the left and right 
partitions,
>and then recurse as usual.  I would think this could be generalized
>to handle a linked list of arrays (left as an exercise to the reader ;-).


Could you give me a reference (or two) where I might be able to find the 
Quick Sort variation you mentioned?

-
If at first you don't succeed, destroy all evidence that you ever tried. 
<< Iceman >>