Question: int fun ( int a , int b ) { if ( a > b ) { while ( a > = b ) {
int funint a int b if a b while a b a ; b ; 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
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
