Question

What is the cyclomatic complexity of the following pseudo code program segment? Use line numbers in the left column to indicate independent paths. Hint: Draw a flowchart and draw execution lines through the flowchart.

1) Read (A, B)

2) If (A>B)

3)       Print A

4) Else

5)       Print B

6) While (A>B)

7)       A = A-1

8) End

Answer 1

1) Read (A, B)
O(1)
2) If (A>B)
3)       Print A
O(1)
4) Else
5)       Print B
O(1)
6) While (A>B)
7)       A = A-1
O(Infinity)
8) End
===============================
6) While (A>B)
7)       A = A-1
If A < B then the loop never ends.
So, the loop is an infinite loop.

So, complexity = O(Infinity)