Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: mathematical proof

by jdporter (Paladin)
on Feb 03, 2009 at 15:29 UTC ( [id://741021]=note: print w/replies, xml ) Need Help??


in reply to mathematical proof

I came to the conclusion that the hash is O(1) and the array is O(n), but how can I mathematically prove it?

"I'm not good at math, but my theory is conceptually right, so all I need is for someone to express it in terms of equations."
That nets you 10 Crackpot points.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others avoiding work at the Monastery: (3)
As of 2024-06-23 21:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?
    erzuuli‥ 🛈The London Perl and Raku Workshop takes place on 26th Oct 2024. If your company depends on Perl, please consider sponsoring and/or attending.