medium10 pts · first answer countsmathrecursioncomplexity
Why fib(50) never finishes
`fib(n) = fib(n - 1) + fib(n - 2)` with no caching takes forever for n = 50. Why?
Discussion 0
Join free to post in the discussion.
Related questions
- Cost of plain recursive FibonacciBackend Developer
- Recursion with no base caseBackend Developer
- Hidden memory cost of recursionBackend Developer
- Cost of the knapsack DPBackend Developer
- Recursive maximum depth of a treeBackend Developer
- Call stack depth of recursive traversalBackend Developer
- Remainder of a negative numberBackend Developer
- Why 0.1 + 0.2 is not 0.3Backend Developer