Marty> Actually, IMHO it is not quite that trivial, especially for beginners,
Marty> to write a quicksort algorithm on *lists* in Lisp.
Who would *want* to use quicksort on lists, when he knows about merge sort?
Marty> Some solutions involve using an intermediate tree structure where you
Marty> don't append the pieces, then making one sweep (O(N)) through at the
Marty> end to put it all together, [...]
How big are the space requirements for that solution?
Greetings,
Jens.
--
Internet: ·····@hpbbn.bbn.hp.com | Phone: (0|+49)7031-14-4785 (TELNET 778-4785)
MausNet: Jens Kilian @ BB | Fax : (0|+49)7031-14-2049
---------------------------------+---------------------------------------------
As the air to a bird, or the sea to a fish, so is contempt to the contemptible.