easy5 pts · first answer countsdynamic-programmingmemoization
Fibonacci after adding a cache
You add a cache to recursive Fibonacci so each fib(k) is computed once. What is the new time complexity for fib(n)?
Discussion 0
Join free to post in the discussion.
Related questions
- Signs that a problem suits DPBackend Developer
- What memoisation meansBackend Developer
- What tabulation meansBackend Developer
- Cost of plain recursive FibonacciBackend Developer
- Recursion with no base caseBackend Developer
- Ways to climb five stairsBackend Developer
- Hidden memory cost of recursionBackend Developer
- Why merge sort is not DPBackend Developer