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

Don Stewart dons at galois.com
Sat Jul 18 12:54:04 EDT 2009

> The code below is, I think, n log n, a few seconds on a million + element list.

Have you tried the judy arrays library on Hackage? (It provides a
hashtable, which I've used occasionally)

-- Don

More information about the Haskell-Cafe mailing list