Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!news.sei.cmu.edu!cis.ohio-state.edu!math.ohio-state.edu!cs.utexas.edu!rutgers!njitgw.njit.edu!hertz.njit.edu!jxv3790
From: jxv3790@hertz.njit.edu (Jake Vogelaar)
Subject: Re: Quick Sort in LISP?
Message-ID: <1994Oct4.140004.17295@njitgw.njit.edu>
Sender: news@njit.edu
Nntp-Posting-Host: hertz.njit.edu
Organization: New Jersey Institute of Technology, Newark, New Jersey
References: <36p2vv$h1@basfigw.basf-corp.com> <36pc4q$1ig@tools.near.net>
Date: Tue, 4 Oct 1994 14:00:04 GMT
Lines: 19

In article <36pc4q$1ig@tools.near.net>,
Barry Margolin <barmar@nic.near.net> wrote:
>In article <36p2vv$h1@basfigw.basf-corp.com> vogelaj@nntp.basf-corp.com (Jake Vogelaar) writes:
>>Does anyone have/or know of some lisp source that takes a text file, 
>>sorts it using quick sort and spits the answer to stdout?
>
>Does it really have to be quicksort?  Common Lisp has a built-in SORT
>function, but it's not required to use any particular sorting algorithm.
>
Thanks .. but my intention is to see a lisp routine that does the quick
sort with chopping and recursion and such.  Is this possible?

-jv

-- 
/////////////////////////////-----Jake Vogelaar-----\\\\\\\\\\\\\\\\\\\\\\\\\\
|  jxv3790@hertz.njit.edu - New Jersey Institute of Technology, Newark NJ    |
|  jake.vogelaar@basf-corp.com - TDG, BASF Corporation, Parsippany NJ        |
|  http://hertz.njit.edu/~jxv3790 - My Place on the Web                      |
