[Solved] What is returned by the call wacky 4,6? also how to calculate this recursion?
When you call a function recursively, they add the new function to a stack until have a final result (return). When it occurs, you go back return by return in the stack. An Execution example: First Round wacky(4, 6): 4 <= 1? No, so call wacky(4 – 1, 6 – 1) Second Round wacky(3, 5): … Read more