| |
|
swisspig.net about contact terms of use privacy policy activity site map |
The Beauty of a Lisp Quicksort (Thursday, March 30, 2006)I have discovered the definition of beauty... last night during a hideous exam for Advanced AI, we were instructed to port a very concise, elegant (if rather inefficient) version of Quicksort from a bizarre obscure programming language called Haskell into a similarly concise, elegant (if rather inefficient) version in Lisp. What I presented for my answer on the exam was good, but I have since come up with a thing of beauty. Quicksort in just a few lines of lisp... it may not be the most efficient, but it has to be the most concise. And it is also the first time in my life, that I have been able to reproduce Quicksort from memory. And here it is:
CommentsWell, LISP is really good -- Alexander (3/30/2007 8:23 AM)
It occurs to me that I mentioned this implementation wasn't the most efficient, but I'm surprised I forgot to explain why. -- Brian (3/30/2007 10:40 PM)
I hate lisp! Our teacher was crazy man - lisp-lover! May be I'm not right, but Ithink so! -- Kabait (6/21/2008 9:41 AM)
It's truly beautiful! :) -- André Laszlo (9/27/2008 1:42 PM)
|
|
All material copyright © 1995-2009 by
Brian Ziman, unless otherwise noted.
| |