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.

Language: C - Size: 22.5 KB - Last synced at: 7 days ago - Pushed at: over 2 years ago - Stars: 1 - Forks: 0