Question: In the following C function, let n > m. int gcd(n,m){ if (n%m 0) return m; n = n%m; return gcd(m, n); } How
In the following C function, let n > m. int gcd(n,m){ if (n%m 0) return m; n = n%m; return gcd(m, n); } How many recursive calls are made by this function?
Step by Step Solution
3.43 Rating (153 Votes )
There are 3 Steps involved in it
This C function calculates the greatest common divisor gcd of two numbers n and m recursively using ... View full answer
Get step-by-step solutions from verified subject matter experts
