Beautiful Quicksort in Common Lisp & Haskell

[zzz6519003]

Link: http://blog.thezerobit.com/2012/09/01/beautiful-quicksort-in-common-lisp.html

The canonical “beautiful” Haskell function is the quicksort. Here it is:

quicksort :: Ord a => [a] -> [a]
quicksort []     = []
quicksort (p:xs) = (quicksort lesser) ++ [p] ++ (quicksort greater)
    where
        lesser  = filter (< p) xs
        greater = filter (>= p) xs