Medium

07. Recursion & Divide-and-Conquer

Problem Objective

Write a recursive function int fib(int n) where fib(0)=0, fib(1)=1, and fib(n) = fib(n-1) + fib(n-2).

Expected Terminal OutputStandard Out

fib(7) = 13

[✓] Recursion stack verified (Time: 0.007s, Memory: 2.1 MB)

Execution Constraints

Implementation Checklist

Check n <= 0 return 0Check n == 1 return 1Return fib(n-1) + fib(n-2)

main.cppg++ -std=c++20 -O2

Loading Bytes Space Editor...