Re: Anyone help develop an algorythm?

[NKSW39B@prodigy.com (Matthew Givens)]

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 >>