https://github.com/basemax/0-1knapsackgreedyc
This is an implementation of the 0-1 knapsack problem in C using a greedy algorithm. 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-1knapsackgreedyc
c greedy greedy-algorithm greedy-algorithms greedy-programming knapsack knapsack-01 knapsack-greedy knapsack-problem knapsack-problem-greedy knapsack-solver knapsack0-1 knapsack01
Last synced: 9 months ago
JSON representation
This is an implementation of the 0-1 knapsack problem in C using a greedy algorithm. 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-1knapsackgreedyc
- Owner: BaseMax
- License: gpl-3.0
- Created: 2023-01-14T13:52:57.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2023-01-14T14:00:07.000Z (almost 3 years ago)
- Last Synced: 2025-03-28T17:08:04.305Z (9 months ago)
- Topics: c, greedy, greedy-algorithm, greedy-algorithms, greedy-programming, knapsack, knapsack-01, knapsack-greedy, knapsack-problem, knapsack-problem-greedy, knapsack-solver, knapsack0-1, knapsack01
- Language: C
- Homepage:
- Size: 17.6 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0