Re:Hash tables with O(1) worst-case lookup and space efficie...
by pbewig on Sunday February 20, 2011 @07:55PM
(#2243740)
I almost always prefer some kind of balanced tree to a hash table, because no matter the original specifications, sometime during the development of a program I usually need the elements in order.
[ Parent
| on HN ]
There are no comments on this comment yet.