Gate CS-2007 Question Paper With Solutions

Q. 8 In the following C function, let n # m.

int gcd(n,m)  {
    if (n%m == ) return m;
    n = n%m;
    return gcd(m,n);
}

How many recursive calls are made by this function?

Answer: (A)

Explanation:

Learn More: Gate CS-2012 Question Paper With Solutions