文献类型：期刊文献

中文题名：贪心算法与动态规划的比较

英文题名：A Comparison of Dynamic Planning and Greedy Algorithm

作者：张洁[1];朱莉娟[1];

机构：[1]中国地质大学(武汉)计算机学院,湖北,武汉,430074 新乡师范高等专科学校,计科系,河南,新乡,453000;

第一机构：新乡学院计算机与信息工程学院

年份：2005

卷号：0

期号：5

起止页码：18-20

中文期刊名：新乡师范高等专科学校学报

外文期刊名：Journal of Xinxiang Teachers College

语种：中文

中文关键词：动态规划;贪心算法;背包问题

外文关键词：dynamic planning; greedy algorithm; question of the knapsack

摘要：介绍了计算机算法设计的两种常用算法思想:贪心算法与动态规划算法.通过介绍两种算法思想的基本原理,比较两种算法的联系和区别.通过背包问题对比了两种算法的使用特点和使用范围.
The algorithm is the accurate description which solves the problem method , the task that the algorithm is designed is to design good algorithm and research law and method that designed the algorithm to all kinds of problems. Two kinds of popular algorithm thoughts are mainly introduced in this article, greedy algorithm and dynamic planning algorithm. The basic principle and concrete instance, algorithm of thought, are compared in this article, and the connection and difference between these two algorithms are also introduced. Finally the authors compared these two algorithms in the application and character by using the knapsack question as the concrete example.