# Calculating Cyclomatic Complexity?

To calculate the cyclomatic complexity, get the number of 'if' statements in your program and add them to the sum of 'then' statements. Count the number of cases within 'select' statements leaving out the default and add them to the loops in your program ignoring the unconditional ones. Count the try or catch statements then add all the numbers in these steps plus one.
Q&A Related to "Calculating Cyclomatic Complexity?"
 1. Count the number of if/then statements in your program. Count each elseif/then statement as a separate one, then total the number. 2. Find any select (also know as switch) statements http://www.ehow.com/how_7870069_calculate-cyclomat...
 Cyclomatic complexity is a software metric (measurement) developed by Thomas McCabe and is used to measure the complexity of a program. It directly measures the number of linearly http://wiki.answers.com/Q/What_is_cyclomatic_compl...
 its a measure (metric) of the complexity (or testability) of a program or function... at its basic its the number of possible execution paths through the code... you can use it to http://answers.yahoo.com/question/index?qid=100604...
 Let's take a simple example. Say you have a list with n elements, and you want to put it into alphabetical order, using the following algorithm: Go through the list and find the http://www.quora.com/What-is-a-general-method-for-...
Similar Questions
Top Related Searches
Explore this Topic
1. Count the number of if/then statements in your program. Count each elseif/then statement as a separate one, then total the number. 2. Find any select (also ...
A complex fraction is a kind of fraction in which the numerator, denominator or both contain a fraction. It can also refer to a fraction which has one or more ...
You can divide complex numbers just like you would a normal number. A calculator will prove to be very helpful when dividing complex numbers. If you do not have ...