How to solve Knapsack with large capacity

Vote count:

0

I am new to dynamic programming. I try to solve Knapsack problem with DP using bottom up approach. But capacity of the thief is very large so that profit capacity array is really large. Can any one plese tell me a way of solving this?

asked 20 secs ago

Chamath Sajeewa

25

How to solve Knapsack with large capacity