-
-
Notifications
You must be signed in to change notification settings - Fork 47.3k
Labels
enhancementThis PR modified some existing filesThis PR modified some existing files
Description
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.
Metadata
Metadata
Assignees
Labels
enhancementThis PR modified some existing filesThis PR modified some existing files
Activity
balkishan69 commentedon Oct 1, 2023
abhishek09827 commentedon Oct 1, 2023
Jiang15 commentedon Oct 1, 2023
I already created a PR here #9295
Create Enhancement of the knapsack algorithm TheAlgorithms#9266
Create Enhancement of the knapsack algorithm TheAlgorithms#9266
Merge pull request #2 from swapnil290502/swapnil290502-patch-2-1
Revert "Create Enhancement of the knapsack algorithm TheAlgorithms#9266"
Merge pull request #3 from swapnil290502/revert-2-swapnil290502-patch…
cclauss commentedon Oct 15, 2023
CONTRIBUTING.md
says: