Greedy algorithm for knapsack problem. Knapsack problem greedy algorithm efficiency requirements in accordance with the unit value of the capacity measure of the level of sort, and then select the grade, get the optimal solution. Implement this algorithm, the number of items, each item of the effectiveness of value, capacity value, pack capacity value by the keyboard input the output have the details of each item.

背包问题.cpp
背包问题.exe

• 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．