Elegance of Haskell

quicksort [] = []
quicksort (x:xs) = quicksort small ++ (x : quicksort large)
where small = [y | y <- xs, y <= x]
large = [y | y <- xs, y > x]

Another advantage of Haskell over Lisp, it does not depend on executing data being off(Data Execution Prevention/Write^Execute/NX bit/eXecute Disable) while Lisp (as if it were 90's self-modifying virus) builds "executable data structures". Haskell respects the data/code boundaries and security of the machine it runs on, Lisp is an open window to viral code and exploits.