[Haskell-cafe] Quick Sort Algorithm

[=?windows-1250?Q?Du=9Aan_Kol=E1=F8?=]

Well, I don't know if it is by encoding of letters in your e-mail, but 
what do you expect that
[a | a . xs, a x ]
would do?

Dusan

PR Stanley wrote:
> Yes, sorry, I missed the firt line of the algorithm when I was pasting 
> it into the email. Okay
> qSort [] = [x]
> -- and even
> qSort [x] = x
> The code fragment below still doesn't work.
>
>>> qSort (x:xs) =
>>>     qSort smaller ++ [x] ++ qSort larger
>>>     where
>>>     smaller = [a | a . xs, a x ]
>>>     larger = [b | b . xs, b > x ]
>
> Cheers
> Paul
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe