[Haskell-cafe] k-minima in Haskell

Ronny Wichers Schreur ronny at cs.ru.nl
Mon Apr 16 06:11:11 EDT 2007


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


More information about the Haskell-Cafe mailing list