| 汉诺塔非递归算法 |
| |
| 引用本文： | 陈文.汉诺塔非递归算法[J].电脑编程技巧与维护,2009(14):10-11,51. |
| |
| 作者姓名： | 陈文 |
| |
| 作者单位： | 福州职业技术学院计算机系,福州,350108 |
| |
| 摘 要： | 分析汉诺塔递归算法的特点，由递归算法，结合二叉树的中序遍历算法，提出汉诺塔二叉树的概念及创建方法，并证明汉诺塔二叉树特点。由此进一步导出兼顾时间效率与空间效率的非递归算法。最后，提供实现算法的C语言程序。
|
| 关 键 词： | 汉诺塔 非递归算法 二叉树 |
Non-Recursion Algorithm of Tower-of-Hanoi |
| |
| CHEN Wen.Non-Recursion Algorithm of Tower-of-Hanoi[J].Computer Programming Skills & Maintenance,2009(14):10-11,51. |
| |
| Authors: | CHEN Wen |
| |
| Affiliation: | CHEN Wen(Department of Computer,Fuzhou Polytechnic College,Fuzhou 350108) |
| |
| Abstract: | analyzing the character of recursion algorithm for Tower-of Hanoi, combining recursion algorithm with binary＇s in-order-traveling algorithm, a new concept called Hanoi-binary-tree is put forwarded. And a method to create the Hanoi- binary-tree is provided. It analyzes and proves the character of Hanoi-binary-tree. Also, it gives a non-recursion algorithm which balances time complexity and space complexity. At last, it gives a program for the algorithm which is written by C. |
| |
| Keywords: | Tower-of -Hanoi Non-Recursion Algorithm Binary Tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
