https://github.com/basemax/0-1knapsackdynamicprogrammingc
This is an implementation of the 0-1 knapsack problem in C using dynamic programming. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.
https://github.com/basemax/0-1knapsackdynamicprogrammingc
c knapsack knapsack-problem knapsack-problem-dynamic knapsack-solution knapsack-solver knapsack0-1 knapsack01
Last synced: 11 months ago
JSON representation
This is an implementation of the 0-1 knapsack problem in C using dynamic programming. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.
- Host: GitHub
- URL: https://github.com/basemax/0-1knapsackdynamicprogrammingc
- Owner: BaseMax
- License: gpl-3.0
- Created: 2023-01-14T09:21:25.000Z (about 3 years ago)
- Default Branch: main
- Last Pushed: 2023-01-14T13:50:44.000Z (about 3 years ago)
- Last Synced: 2025-03-28T17:08:04.349Z (11 months ago)
- Topics: c, knapsack, knapsack-problem, knapsack-problem-dynamic, knapsack-solution, knapsack-solver, knapsack0-1, knapsack01
- Language: C
- Homepage:
- Size: 24.4 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0