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

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@gmail.com