Trace a Recursive method

Question

Consider this recursive function.

public static int f(int x)

{

if (x > 1000)

return x - 4;

else

return f(f(x+5));

}

Write out the steps of the program in order to find the value of f(0).

(Hint: You’re welcome to note any quick shortcuts to the answer.)

Answer 1

What is important here is the base case of (x > 1000)

because the recursive call will continue to be called and increment x by 5 each time. We meet the base case condition when x == 1001 and it is returned with -4. That equals 997.