Skip to content

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

License

Notifications You must be signed in to change notification settings

BaseMax/KnapsackProblemC

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Knapsack Problem in C

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

Usage

$ gcc KnapsackProblem.c -o KnapsackProblem
./KnapsackProblem

$ gcc KnapsackProblemTree.c -o KnapsackProblemTree
./KnapsackProblemTree

Copyright (c) 2022, Max Base

Releases

No releases published

Packages

No packages published

Languages