Company: Accenture_25july
Difficulty: easy
There is a recursive function implemented with the following pseudocode. function f(a, b) { if (b == 0) { return a } else { return f(b, the remainder after dividing a by b) } } Calculate the following. (The a and b given first are integers of 1 or more.) f(10, 2) = ? Output Format Print the value of f(10, 2).