Enhancement of the knapsack algorithm

There is a recursive implementation of 0-1 knapsack problem. The idea is to enhance it with code optimization and feature extension.

Optimize the recursion with memorization (DP) which reduces the complexity to O(KN).
Implement knapsack algorithm which gives the option to allow the items been repetitively picked multiple times, i.e, either 0-1 or 0-N knapsack problem.

I already created a PR here #9295

Merge pull request #2 from swapnil290502/swapnil290502-patch-2-1

Merge pull request #3 from swapnil290502/revert-2-swapnil290502-patch…

Do not create an issue to contribute an algorithm. Please submit a pull request instead.

Navigation Menu