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

On Wed, Apr 11, 2007 at 09:20:12PM -0700, Tim Chevalier wrote:

On 4/11/07, Stefan O'Rear wrote:

...

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

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

(A stable quicksort, btw)

You may be missing a few recursive calls there :-)

Indeed. Stefan