[Haskell-cafe] can there be (hash-table using) O(n) version of this (I think currently) n log n algo?

Bulat Ziganshin bulat.ziganshin at gmail.com
Sat Jul 18 11:57:04 EDT 2009

Hello Thomas,

Saturday, July 18, 2009, 7:23:10 PM, you wrote:

> Going back to my original question, I am now looking for a dead simple
> motivating example for showing the example of using a (good) hashtable
> over Data.Map

spell checking?

Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com

More information about the Haskell-Cafe mailing list