Tracing a simple recursive function

Question

Accepted Answer

Each call prints n before making the recursive call, so the output appears in descending order. When n reaches 0, the base case runs: 'done' is printed and the function returns without recursing further. Tracing through a recursive function call-by-call is the most reliable way to understand what it produces.