| 算法策略比较 |
| |
| 引用本文： | 万臣,佘永勤. 算法策略比较[J]. 教育技术导刊, 2009, 0(2) |
| |
| 作者姓名： | 万臣 佘永勤 |
| |
| 作者单位： | 武汉生物工程学院计算机系;华中科技大学软件学院; |
| |
| 基金项目： | 武汉市教育局教学研究基金资助项目(200734) |
| |
| 摘 要： | 基本的算法策略有迭代法、蛮力法、分治法、贪婪法、动态规划等。以整数因子分解为例,试图比较各种算法的优劣,并提出每种算法适合的问题类型。
|
| 关 键 词： | 穷举法 迭代法 数学模型 分治法 动态规划 比较 |
Comparison on Algorithm Strategy |
| |
| Wan Chen She Yongqin. Comparison on Algorithm Strategy[J]. Introduction of Educational Technology, 2009, 0(2) |
| |
| Authors: | Wan Chen She Yongqin |
| |
| Abstract: | The basic algorithm strategy iteration, the brute force method, divided law, law of greed, dynamic programming, and so on. These method have their own advantages and disadvantages,this paper as an example to integer factorization algorithm attempts to the su- perior or inferior rank, and put forward each problem of kind of algorithms suitable type. |
| |
| Keywords: | Exhaustion Law Iteration Mathematic Model Divided Law Avaricious Law Dynamic Programming Comparison |
| 本文献已被 CNKI 等数据库收录！ |
|
