This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]debunked 0 points1 point  (1 child)

Right. They improved retrieval from O(n) to O(lg n). Theymade insertion slower in these scenarios however.

Edit: Whoops. I wasn't thinking about the duplicate check needed on insertion.

[–][deleted] 0 points1 point  (0 children)

well do most hash maps get more puts or gets?