| 广义Hanoi塔问题的求解算法和时间复杂度分析 |
| |
| 引用本文： | 赵天玉,王朝平. 广义Hanoi塔问题的求解算法和时间复杂度分析[J]. 石油天然气学报, 2003, 25(4): 132-134 |
| |
| 作者姓名： | 赵天玉 王朝平 |
| |
| 作者单位： | 江汉石油学院理学院,湖北,荆州,434023 |
| |
| 摘 要： | 对递归问题的典型代表Hanoi塔问题作了一些变化，就圆盘的大小、个数辅助柱的个数进行了推广，给出了这种广义Hanoi塔问题的求解算法和时间复杂度分析。该算法对研究一般递归问题具有一定的借鉴作用。
|
| 关 键 词： | Hanoi塔问题 限制 算法 复杂度 |
| 文章编号： | 1000-9752(2003)04-0132-03 |
| 修稿时间： | 2003-08-13 |
Agorithm and Time Complexity Analysis of Generalized Hanoi Tower Problem |
| |
| ZHAO Tian-yu,WANQ Chao-ping. Agorithm and Time Complexity Analysis of Generalized Hanoi Tower Problem[J]. Journal of Oil and Gas Technology, 2003, 25(4): 132-134 |
| |
| Authors: | ZHAO Tian-yu WANQ Chao-ping |
| |
| Abstract: | Some changes are made on the typical examples of Hanoi tower problems in recursive problems, the size and number of discs and the number of assistant posts are introduced. The algorithm and time complexity for solving the generalized Hanoi tower problems are analyzed, which helps the research of the general recursive problems. |
| |
| Keywords: | Hanoi tower problem limit complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
