Felix Martin c21240d9ea Make depth first search for Knapsack non-recursive and more efficient. Solves all problems in reasonable time now.		2019-12-10 12:32:10 -05:00
..
data	Finished week 1.	2019-11-24 13:28:23 -05:00
_coursera	Finished week 1.	2019-11-24 13:28:23 -05:00
handout.pdf	Finished week 1.	2019-11-24 13:28:23 -05:00
knapsack.py	Make depth first search for Knapsack non-recursive and more efficient. Solves all problems in reasonable time now.	2019-12-10 12:32:10 -05:00
Solver.java	Finished week 1.	2019-11-24 13:28:23 -05:00
solver.py	Make depth first search for Knapsack non-recursive and more efficient. Solves all problems in reasonable time now.	2019-12-10 12:32:10 -05:00
solverJava.py	Finished week 1.	2019-11-24 13:28:23 -05:00
submit.py	Finished week 1.	2019-11-24 13:28:23 -05:00