Description: 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.
To Search:
- [beibao] - Solve the knapsack problem, use the gree
- [bag] - Classical knapsack problem, the use of g
File list (Check if you may need any files):
背包问题.cpp
背包问题.exe
Download