算法设计与分析的经典程序，主要有0-1背包问题，最小生成树等。-algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.

程序功能：已知一定容量的背包和一定重量、一定个数的物品，背包容量、物品重量和物品个数可以自己设定，要求向背包中装入物品，使装入的物品恰好为被包的最大容量。若没有这样的物品组合，则输出“No available combination !”。-procedures functions : some capacity known knapsack and a certain weight, a certain number of items, bags capacity, weight and th

贪婪算法解决背包问题-greedy algorithm to solve knapsack problem

动态规划解决0-1背包问题-0-1 knapsack problem