文件名称:baggreedy
介绍说明--下载内容均来自于网络,请自行研究使用
改写成面向对象的贪心算法(背包问题),一定容量,每个物体按效益/重量排序,本例只有三个物体-Rewritten into a greedy algorithm for object-oriented (knapsack problem), a certain capacity, for each object according to benefit/weight sorting, which in this case only three objects
(系统自动生成,下载前可以参看下载内容)
下载文件列表
baggreedy.cpp