摘要
基本的算法策略有迭代法、蛮力法、分治法、贪婪法、动态规划等。以整数因子分解为例,试图比较各种算法的优劣,并提出每种算法适合的问题类型。
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 superior or inferior rank, and put forward each problem of kind of algorithms suitable type.
出处
《软件导刊》
2009年第2期39-40,共2页
Software Guide
基金
武汉市教育局教学研究基金资助项目(200734)
关键词
穷举法
迭代法
数学模型
分治法
动态规划
比较
Exhaustion Law
Iteration
Mathematic Model
Divided Law
Avaricious Law
Dynamic Programming
Comparison