mirror of
https://github.com/TheAlgorithms/C.git
synced 2026-02-14 05:44:36 +00:00
[PR #1500] [CLOSED] Add 0/1 Knapsack Problem using Dynamic Programming #2103
Reference in New Issue
Block a user
Delete Branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
📋 Pull Request Information
Original PR: https://github.com/TheAlgorithms/C/pull/1500
Author: @ChaitanyaShah26
Created: 10/12/2025
Status: ❌ Closed
Base:
master← Head:master📝 Commits (1)
90e19deAdd 0/1 Knapsack Problem using Dynamic Programming📊 Changes
1 file changed (+104 additions, -0 deletions)
View changed files
➕
dynamic_programming/01Knapsack.c(+104 -0)📄 Description
Description of Change
I have added a new code for the 0/1 Knapsack Problem which follows a Dynamic Programming approach.
References
None
Checklist
🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.