The diagram shows <code>f(n)</code> computing
- Acheck_circle
Sum of n down to 0
- B
n * f(n-1)
- C
Constant 0
- D
f(n+1)
Explanation
Each call returns its n + result of f(n-1); base f(0)=0 → cumulative sum.
Recursive Searching and Sorting (Binary Search, Merge Sort)
AP Computer Science A· difficulty 4/5
Want 10 more like this — adaptive to your weak spots?