Description: Knapsack problem: the greedy algorithm knapsack problem required the capacity benefits in accordance with unit value 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.
To Search:
File list (Check if you may need any files):
knapsack problem\程序及结果.doc
................\背包问题.rar
................\说明.txt
knapsack problem
Download