Skip to content
#

knapsack-01

Here are 2 public repositories matching this topic...

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.

  • Updated Jan 14, 2023
  • C

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.

  • Updated Jan 14, 2023
  • C

Improve this page

Add a description, image, and links to the knapsack-01 topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the knapsack-01 topic, visit your repo's landing page and select "manage topics."

Learn more