Question: int fun ( int a , int b ) { if ( a > b ) { while ( a > = b ) {

int fun(int a, int b){ if (a > b){ while (a >= b){ a -=1; b +=1; }} else { b += a; } return b; }
What is the cyclomatic complexity (# of independent paths) in the code segment given?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!