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

Re: Algorithm complexity

by Herkum (Parson)
on Jul 07, 2009 at 22:32 UTC ( #778056=note: print w/replies, xml ) Need Help??


in reply to Algorithm complexity

As someone touched on the big O notation and I know nothing on that subject I will offer another tool for measuring complexity.

Look up on cpan McCabe which is a very simple formula for determining the complexity of a particular piece of code. You can also look up Cyclomatic complexity for a explanation of the subject.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://778056]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (5)
As of 2017-11-19 00:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:













    Results (278 votes). Check out past polls.

    Notices?