Algorithms | Analysis of Algorithms | Question 14
In the following C function, let n >= m.
How many recursive calls are made by this function?
Explanation: Above code is implementation of the Euclidean algorithm for finding Greatest Common Divisor (GCD).
Please see http://mathworld.wolfram.com/EuclideanAlgorithm.html for time complexity.
Quiz of this Question