Re: [Haskell-cafe] k-minima in Haskell

On 4/11/07, Stefan O'Rear <stefanor@cox.net> wrote:

If you want to be really explicit about it, here is a sort that will work:

sort [] = [] sort l@(x:_) = filter (<x) l ++ filter (==x) l ++ filter (>x) l

(A stable quicksort, btw)

You may be missing a few recursive calls there :-) Cheers, Tim -- Tim Chevalier * chevalier@alum.wellesley.edu * Often in error, never in doubt Confused? See http://catamorphism.org/transition.html