Software Engineering discussion

Here is an even more compact quicksort:

qsort [] = []
qsort (x:xs) = qsort (filter (< x) xs) ++ [x] ++ qsort (filter (>= x) xs)

I think that some of the Haskell advantages in compactness and readability (after a little learning curve) shine through with this example.

I think this example could be a good fit for language design discussions in this book.