We implemented different algorithm techniques to solve the knapsack 0/1 problem and then compared the performance of each different algorithm.

Algorithms coded: "Brute force", "Backtracking" and "Dynamic Programming". Language used: C++ and python.