[Haskell-cafe] Quick Sort Algorithm

Hi folks qSort (x:xs) = qSort smaller ++ [x] ++ qSort larger where smaller = [a | a . xs, a x ] larger = [b | b . xs, b > x ] Any idea why I can't get this to work? Thanks, Paul