Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Hash table

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]

Name: Anonymous 2012-02-12 2:35

>>1
O(n) to calculate the length of the string? Sure. What does that n mean in that case? How is it different from O(n) time to insert into the middle of an array?

Newer Posts

Hash table

1 Name: Anonymous 2012-02-12 0:24

5 Name: Anonymous 2012-02-12 2:35

Name: Anonymous 2012-02-12 0:24

Name: Anonymous 2012-02-12 2:35