Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!news.duke.edu!concert!sas!mozart.unx.sas.com!sasmsr
From: sasmsr@zinfande.unx.sas.com (Mark S. Riggle)
Subject: Re: Quick Sort in LISP?
Originator: sasmsr@zinfande.unx.sas.com
Sender: news@unx.sas.com (Noter of Newsworthy Events)
Message-ID: <Cx7sxB.8Ms@unx.sas.com>
Date: Wed, 5 Oct 1994 19:31:59 GMT
References: <36pc4q$1ig@tools.near.net> <1994Oct4.140004.17295@njitgw.njit.edu> <MARCOXA.94Oct4145138@mosaic.nyu.edu> <Cx79rK.LGB@aplcenmp.apl.jhu.edu>
Nntp-Posting-Host: zinfande.unx.sas.com
Organization: SAS Institute Inc. Cary NC
Lines: 26


In article <Cx79rK.LGB@aplcenmp.apl.jhu.edu>, hall@aplcenmp.apl.jhu.edu (Marty Hall) writes:
|> marcoxa@mosaic.nyu.edu (Marco Antoniotti) writes:
|> > jxv3790@hertz.njit.edu (Jake Vogelaar) writes:
|> [...]
|> >   Thanks .. but my intention is to see a lisp routine that does the quick
|> >   sort with chopping and recursion and such.  Is this possible?
|> [...]
|> >Barry gave the best answer in Common Lisp. If you wan to rewrite it is
|> >just a trivial adaptation of any Algorithm book.
|> 


An aside here.  The internal implementation of the sort function
in Common Lisp cannot be a quicksort since it is an unstable sort
and a stable sort is specified.  

-- 
=========================================================
Mark Riggle                         | "Give me LAMBDA or
sasmsr@unx.sas.com                  |  give me death"
SAS Institute Inc.,                 |
SAS Campus Drive, Cary, NC, 27513   |  
(919) 677-8000                      |


