knapsack0-1

There are 0 repository under knapsack0-1 topic.

• 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.

  cknapsackknapsack-problemknapsack-solutionknapsack-solverknapsack0-1knapsack01knapsack-01knapsack-problem-recursiveknapsack-recursive
  Language:C 1

• 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.

  cknapsackknapsack-problemknapsack-problem-dynamicknapsack-solutionknapsack-solverknapsack01knapsack0-1
  Language:C

• 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.

  cgreedygreedy-algorithmgreedy-algorithmsgreedy-programmingknapsackknapsack-01knapsack-problemknapsack-problem-greedyknapsack-solverknapsack0-1knapsack01knapsack-greedy
  Language:C