Name: Anonymous 2012-02-12 0:24
Is it ever possible to have a Hash table that can do get,put,remove @ O(1) for Strings?
calculating the hash for the String alone is O(n), is it not? [that's if you want to produce a good hash that won't collide all over the place]
calculating the hash for the String alone is O(n), is it not? [that's if you want to produce a good hash that won't collide all over the place]