Fibonacci: A sequence where each number is the sum of the two before it: fib(n) = fib(n-1) + fib(n-2).
How to apply it: Recognize that naive recursive Fibonacci has exponential time complexity due to repeated calls.
Course: AP Computer Science A · Unit: Recursion
Practice questions about Fibonacci on AimFive — get rubric-based feedback showing exactly which points you earned.
AP and Advanced Placement are trademarks of College Board. AimFive is not affiliated with or endorsed by College Board.