more useful options | |
PerlMonks |
Re^5: "Just use a hash": An overworked mantra?by vkon (Curate) |
on Dec 24, 2011 at 21:20 UTC ( [id://945040]=note: print w/replies, xml ) | Need Help?? |
yes, they are O(n x log n) how do the hashes work.
ok, hash is computed (some say these are O(log n) i do not know but this time I trust the links provided to me by davido) and then - based on computed hash - it could be hash hit or miss: either "luck" - (this is what usually happens) - this was different on all previous values.
in that latter case - insertion/search happens (based on exact operation), which is O(n) otherwise this hunk of hv.c code is what for:
In Section
Meditations
|
|