[Haskell-cafe] Quick Sort Algorithm

[Andrew Wagner]

You could also look at
http://haskell.org/haskellwiki/Introduction#Quicksort_in_Haskell
if the algorithm is all you're interested in, and not the particular
implementation.

On 5/17/07, Andrew Coppin <andrewcoppin at btinternet.com> wrote:
> PR Stanley wrote:
> > 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? ;-)
>
> 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
>