note
vkon
yes. I am sure.
<p>
first, the third link you've pointed reads:
<br><i>
Thus—formally—hash tables often run in time O(log n). </i>
<p>
next, if the question is "is it possible to create an algorithm that, given arbitrary strings of finite length, make associative store/lookup for O(1)" - then the answer is "yes" but these are non-realistic algorithms.
<br>but - back to reality - real-life alhorithms are O(log N) in best case, but I afraid Perl's one is worse than that<br>and - yet - have you ever heard of so-called "hash complexity attack" that was security-fixed by seed randomization in 5.8.0?<br>To inform you, pre-5.8.0 were looking like O(1) but actually were O(n) (or maybe even worse in worst case scenario)
<p>next, your "stackoverflow.com" link contains simply wrong information.<br>IOW, I do not see any proof there that convinces me.
<p>And - your last link does not even mention hashes.
<br>Bother explain what is doing here? TIA!
<p>and finally, do you see something strange in your phrase <i><br>hash operations are O(1) operations, where 'n' is the number of elements in the hash<br></i>
?
<br>I could be a bit joking, but I do not trust phrases like that.
<br>you're explaining parameter 'n' that is not presents in your formulae - what other mistakes/typos have you made?
<br>:)
938456
944961