https://github.com/basemax/0-1knapsackrecursivec

This is an implementation of the 0-1 knapsack problem in C using a recursive approach. 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.

c knapsack knapsack-01 knapsack-problem knapsack-problem-recursive knapsack-recursive knapsack-solution knapsack-solver knapsack0-1 knapsack01

Last synced: 03 Apr 2025