Dynamic Programming21 sections · 916 units
Open in Course

Quiz: Memoization Complexity

Knowledge check

Check Your Understanding

After applying memoization to naive Fibonacci, what is the new time complexity?

  1. A.O(2n)O(2^n)
  2. B.O(n)O(n)
  3. C.O(n2)O(n^2)
  4. D.O(logn)O(\\log n)
Start the roadmap to answer the quizzes and solve the challenges