mirror of
https://github.com/TheAlgorithms/C.git
synced 2026-02-04 05:44:35 +00:00
[PR #984] feat: knapsack algorithm #1525
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?
Original Pull Request: https://github.com/TheAlgorithms/C/pull/984
State: closed
Merged: No
Description of Change
The Knapsack Problem is also called as rucksack problem. A basic C program is written to solve knapsack problem given with set of items each with a mass and value. Describe every individual item included in a collection so that total weight is less than or equal to a given limit and total value is as large as possible. A fixed size knapsack is defined at the beginning. It must fill with most valuable items.
References
Checklist
Notes: