精选优质文档-倾情为你奉上贪心算法解决活动安排问题金 潇Use the greedy algorithm to solve the arrangement for activities Jinxiao摘要：贪心算法在当前来看是最好的选择。是用利用启发式策略，在不从整体最优上加以考虑的情况下，来做出局部最优选择的一种算法。本文通过贪心算法的经典案例活动安排问题入手，描述了贪心算法的基本思想和可能产生的问题，并简述该算法的好处和特点，最后给出几种经典的贪心算法。关键字：贪心算法、局部最优选择Abstract:A greedy algorithm is any algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding the global optimum. This article through the greedy algorithm of the cl
