[Haskell-cafe] Quick Sort Algorithm

PR Stanley prstanley at ntlworld.com
Thu May 17 15:21:51 EDT 2007


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



More information about the Haskell-Cafe mailing list