Enhancement of the knapsack algorithm

[Jiang15]

Feature description

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.

[balkishan69]

hey @Jiang15 can i get assigned this issue...

[abhishek09827]

hey @Jiang15 I have already solved the issue pls assign this to me

[Jiang15]

I already created a PR here #9295

[cclauss]

CONTRIBUTING.md says:

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