[Haskell-cafe] Quick Sort Algorithm

[PR Stanley]

Well, actually, this was scanned from a book but the OCR process 
wasn't 100% effective. So, I was hoping the list would easily 
identify and replace the erronious characters.
Thanks for trying, anyway.
Paul
At 20:46 17/05/2007, you wrote:
>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