GitHub / 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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2F0-1KnapsackDynamicProgrammingC
Stars: 1
Forks: 0
Open issues: 0
License: gpl-3.0
Language: C
Size: 24.4 KB
Dependencies parsed at: Pending
Created at: over 2 years ago
Updated at: 3 months ago
Pushed at: over 2 years ago
Last synced at: 7 days ago
Topics: c, knapsack, knapsack-problem, knapsack-problem-dynamic, knapsack-solution, knapsack-solver, knapsack0-1, knapsack01
Funding Links https://github.com/sponsors/BaseMax