in reply to Re: Learning Fundamentals: Data Structures and Algorithm Analysis in Perl
in thread Learning Fundamentals: Data Structures and Algorithm Analysis in Perl
I completely agree that O(1) vs. O(N) does get a point across about the Hash emptiness being finite time. Where I was led astray was why O(*) was even mentioned versus ending said post after the first sentence.
Quite usefule reply... and therefore, but none of them, nor the original post methinks, could be considered 'worst case.'
"Strictly speaking, there are no enlightened people, there is only enlightened activity." -- Shunryu Suzuki