[Haskell-cafe] k-minima in Haskell

[Ronny Wichers Schreur]

Yitz writes (in the Haskell Cafe):

> This gives O(log k * (n + k)) execution in constant memory.

I guess that should be O(k) memory.


Cheers,

Ronny Wichers Schreur