Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: mathematical proof

by jdporter (Chancellor)
on Feb 03, 2009 at 15:29 UTC ( #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? | Other CB clients
Other Users?
Others lurking in the Monastery: (6)
As of 2023-09-22 07:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?