Description:
It uses dynamic programming to solve the 0-1 knapsack problem, a better understanding of dynamic programming, understanding the concept of recursion
To Search:
File list (Check if you may need any files):
experiment2.1
.............\Debug
.............\.....\experiment2.1.ilk
.............\.....\experiment2.1.pdb
.............\experiment2.1
.............\experiment2.1.sdf
.............\experiment2.1.sln
.............\experiment2.1.v11.suo
.............\.............\Debug
.............\.............\.....\CL.read.1.tlog
.............\.............\.....\CL.write.1.tlog
.............\.............\.....\experiment2.1.lastbuildstate
.............\.............\.....\experiment2.1.log
.............\.............\.....\link-cvtres.read.1.tlog
.............\.............\.....\link-cvtres.write.1.tlog
.............\.............\.....\link-rc.read.1.tlog
.............\.............\.....\link-rc.write.1.tlog
.............\.............\.....\link.read.1.tlog
.............\.............\.....\link.write.1.tlog
.............\.............\.....\package.obj
.............\.............\.....\vc110.idb
.............\.............\.....\vc110.pdb
.............\.............\experiment2.1.vcxproj
.............\.............\experiment2.1.vcxproj.filters
.............\.............\package.c
Download