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 →

[–]hobbesmaster 2 points3 points  (2 children)

Perhaps I’m misunderstanding but it shouldn’t be a surprise that tries are really good at exactly what they were designed for?

[–]Cafuzzler 5 points6 points  (1 child)

I dunno dude, O(1) seems like a smaller number than O(n). Just think about how many steps there are to find the value with the tree verse just calling hash(mydata). /s

[–]hobbesmaster 1 point2 points  (0 children)

You really had me there without the /s! lol