Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?
 
PerlMonks  

Re: Algorithm complexity

by spx2 (Deacon)
on Mar 12, 2010 at 12:23 UTC ( [id://828274]=note: print w/replies, xml ) Need Help??


in reply to Algorithm complexity

I do not think what you want is possible(or at least I haven't read of anything that proves it is). However , you may try your luck with the following idea: The big O notation refers to classes of function growth, if you are able to measure the time it takes for your algorithm to finish for a reasonable number of values you can make a plot. If you are able to see which classes of functions that plot is most similar to then you are able to approximate where the big O notation will be. Again, this is in no way a rigorous solution, it might work on some problems though ... good luck.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others having an uproarious good time at the Monastery: (6)
As of 2024-03-28 18:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found