/Binary-Knapsack-Problem-DP

It is a classic dynamic programming problem in which we have to collect items in the knapsack in such a way that our profit is maximized. The difference between this problem and the fractional knapsack one is that you CANNOT take a fraction of an item.

Primary LanguageC++

No issues in this repository yet.