与贪心法作了比较，结果表明该方法比较有效。
Compared with greedy methods, its effectiveness is illustrated through result.
采用动态规划法和贪心法对该问题进行求解，分析和比较这两种算法在求解同一问题时的差异。
This paper adopts dynamic programming method and greedy method to solve such problems, then analyzes and compares the differences of two algorithms.
介绍了一种运用贪心法设计磁盘文件存储方式，提高系统文件检索效率的方法，并给出相关的程序。
Introduces an method which applies Greed method to design storage method of data files saved in disks to improve search efficiency, meantime, relative program realize this purpose is given.
应用推荐