Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Recursionmedium
0:00.0

A recursive algorithm is defined: f(n)={0if n≤0f(n−1)+nif n>0f(n) = \begin{cases} 0 & \text{if } n \leq 0 \\ f(n-1) + n & \text{if } n > 0 \end{cases}f(n)={0f(n−1)+n​if n≤0if n>0​. What is the maximum recursion depth (total active stack frames, including the deepest call) when calling f(50)f(50)f(50)?