Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

lames-theorem

GATE CSE & IT · Number Theory & Algorithms · 2007-2007

1
PYQs
100%
keyed
1
elite explanations
1
years appeared

Study anchor

Cormen et al. — Introduction to Algorithms (CLRS)

Algorithms, data structures, graph algorithms, complexity

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2007 PYQ

In the following C function, let n $$ \ge $$ 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?

mediumanswer keyelite explanation