Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!news.sei.cmu.edu!cis.ohio-state.edu!magnus.acs.ohio-state.edu!math.ohio-state.edu!howland.reston.ans.net!EU.net!uknet!festival!jeff
From: jeff@festival.ed.ac.uk (J W Dalton)
Subject: Re: Quick Sort in LISP?
References: <36pc4q$1ig@tools.near.net> <1994Oct4.140004.17295@njitgw.njit.edu> <MARCOXA.94Oct4145138@mosaic.nyu.edu> <Cx79rK.LGB@aplcenmp.apl.jhu.edu> <Cx7sxB.8Ms@unx.sas.com>
Message-ID: <CxBD3I.KsJ@festival.ed.ac.uk>
Organization: Edinburgh University
Date: Fri, 7 Oct 1994 17:40:30 GMT
Lines: 5

Why quicksort?  A merge sort is much better for lists.  Is this
a homework exercise or something?



