BaseMax / KnapsackProblemC

This is a simple implementation of the knapsack problem in C in both recursive and dynamic programming approaches.

1 0 Language: C License: GPL-3.0 Updated: 3y ago

algorithm algorithms algorithms-and-data-structures algorithms-datastructures c data-structure datastructure ds dynamic-programming knapsack

README

This is a simple implementation of the knapsack problem in C in both recursive and dynamic programming approaches.

$ gcc KnapsackProblem.c -o KnapsackProblem
./KnapsackProblem

$ gcc KnapsackProblemTree.c -o KnapsackProblemTree
./KnapsackProblemTree

0 AIs selected

Clear selection

Name

Task