[Haskell-cafe] Quick Sort Algorithm

PR Stanley prstanley at ntlworld.com
Thu May 17 18:06:31 EDT 2007


>>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
>
>...would it not be faster to pick up the book and check what the OCR 
>got wrong? ;-)
>No, Mr. smarty pants, I can't. I'll leave you to work out why I rely 
>on a scanner and an OCR engine for reading printed materials. *smile*
Paul


>Anyway, I'm going to go out on a limb and suggest
>
> > smaller = [a | a <- xs, a <= x]
> > larger = [a | a <- xs, a > x]
>
>_______________________________________________
>Haskell-Cafe mailing list
>Haskell-Cafe at haskell.org
>http://www.haskell.org/mailman/listinfo/haskell-cafe



More information about the Haskell-Cafe mailing list