can we solve dynamic knapsack problem using Memoization approach?

As we know Dynamic programming has two techniques.

1. Bottom up dynamic programming approach.
2. Top down memoization approach

Normally dynamic knapsack problem is solved using Bottom up dynamic programming approach.can we solve dynamic knapsack problem using Memoization approach?

• Have you tried using this approach? Were you successful? – Yuval Filmus Jul 10 '16 at 16:24
• yes I tried it with bottom up dynamic approach and It was successful.It gives 0(nW) time complexity (n=number of items,W=knapsack limit) – dulaj sanjaya Jul 10 '16 at 16:45
• How does the other approach compare? What does it give? – Yuval Filmus Jul 10 '16 at 16:54
• According to this image memoization technique filling the table recursively by results of earlier calls.So can we develop knapsack problem using that technique – dulaj sanjaya Jul 10 '16 at 17:09
• In bottom up approach- Yes.It is working. suppose that name of the 2D array is V. Then v[n][w] gives the correct answer.(doesn't need to full the knapsack) – dulaj sanjaya Jul 10 '16 at 18:06