Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Algorithm complexity

by jettero (Monsignor)
on Jul 07, 2009 at 22:18 UTC ( [id://778045]=note: print w/replies, xml ) Need Help??


in reply to Algorithm complexity

Usually the tool you'd use for that is a human being. I'd be pretty shocked if there were tools like that for any language that actually worked accurately. Although, I'm pretty sure I could detect for(){for(){}} and produce O(N^2).

It's not an exact science in any case. A lot of the cooler parts of the proofs tend to be knowing which parts of the math don't matter (and showing it). That's more like art. Mathematical art, but art. I dare a computer program to do it.

You might be able to get something to measure time slices for given inputs or something, ... I'm not sure that would really show big oh though.

-Paul

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others contemplating the Monastery: (10)
As of 2024-04-23 08:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found