Does recursive method increase cyclomatric complexity

Question

I do not have any programs installed for measuring cyclomatric code complexity at the moment. But I was wondering does a recursive method increases the complexity?

e.g.

// just a simple C# example to recursively find an int[]
// within a pile of string[]
private int[] extractInts(string[] s)
{
    foreach (string s1 in s)
    {
        if (s1.ints.length < 0)
        {
            extractInts(s1);
        }
        else
        {
            return ints;
        }
    }
}

Thanks.

Answer 1

As far as I understand, no. There is only one linearly independent path to the recursive method in your example, so it wouldn't increase the cyclomatic complexity.

Answer 2

1. Loops do increase cyclomatic complexity.
2. A loop can often be rewritten using recursion plus a guard condition.

Even if the recursive call itself would not count strictly as an increment, the guard condition does. This makes the loop and recursion+guard on par.