Description: Knapsack problem (Knapsack problem) is NP-complete combinatorial optimization problem. Problem can be described as: Given a set of items, each item has its own weight and price, the total weight limit, we choose, to make up the total price of items. 2 methods used to achieve knapsack problem, using C language, data structure testing curricular
To Search:
File list (Check if you may need any files):
背包问题\Debug\背包问题.exe
........\.....\背包问题.ilk
........\.....\背包问题.pdb
........\背包问题\Debug\BuildLog.htm
........\........\.....\mt.dep
........\........\.....\stdafx.obj
........\........\.....\vc90.idb
........\........\.....\vc90.pdb
........\........\.....\背包问题.exe.embed.manifest
........\........\.....\背包问题.exe.embed.manifest.res
........\........\.....\背包问题.exe.intermediate.manifest
........\........\.....\背包问题.obj
........\........\.....\背包问题.pch
........\........\ReadMe.txt
........\........\stdafx.cpp
........\........\stdafx.h
........\........\targetver.h
........\........\背包问题.cpp
........\........\背包问题.vcproj
........\........\背包问题.vcproj.LeeTsan-PC.LeeTsan.user
........\背包问题.ncb
........\背包问题.sln
........\背包问题.suo
........\........\Debug
........\Debug
........\背包问题
背包问题
Download