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

背包问题\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
........\背包问题
背包问题

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．