Question: 2. Given an algorithm as: int GCD(int a, int b) { if( b == 0) return 1; else return GCD(b, a % b); } What
2. Given an algorithm as:
int GCD(int a, int b)
{
if( b == 0)
return 1;
else
return GCD(b, a % b);
}
What type of algorithm is this recursive or iterative? Explain your answer. Determine
GCD(56, 48) using the above algorithm.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
