Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

Re^2: Learning Fundamentals: Data Structures and Algorithm Analysis in Perl

by spectre9 (Beadle)
on Apr 29, 2009 at 22:45 UTC ( #760997=note: print w/ replies, xml ) Need Help??


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.'

Cheers, Patrick

"Strictly speaking, there are no enlightened people, there is only enlightened activity." -- Shunryu Suzuki


Comment on Re^2: Learning Fundamentals: Data Structures and Algorithm Analysis in Perl

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://760997]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (6)
As of 2014-09-16 01:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite cookbook is:










    Results (155 votes), past polls