Back to course home
0% completed
Vote For New Content
For the memoisation tecgnique, isn’t the time complexity still 2^n? We still hav...
Mircea C
Mar 5, 2022
For the memoisation tecgnique, isn’t the time complexity still 2^n? We still have 2^n function calls...
0
0
Comments
Comments
Design Gurus4 years ago
We will not have 2^n function calls for the Memoization technique.
As we store the results of each function call in an array, we return the results from the array if we have already called such a function. This means no recursive calls happen from that function downwar...
On this page
Problem Statement
Basic Solution
Code
Top-down Dynamic Programming with Memoization
Code
Bottom-up Dynamic Programming