| Hanoi塔问题一种非递归算法的C++实现 |
| |
| 引用本文： | 贺存薪.Hanoi塔问题一种非递归算法的C++实现[J].电脑开发与应用,2006,19(4):54-56. |
| |
| 作者姓名： | 贺存薪 |
| |
| 作者单位： | 北京交通大学,北京,100044 |
| |
| 摘 要： | 通过对汉诺问题的递归算法及结果的分析,创造性地借助二叉树的数据结构设计出非递归算法。给出了实现该算法的C++语言源程序。该算法并未真正在物理上生成所谓的二叉树,有别于常规对二叉树结构的使用。
|
| 关 键 词： | 汉诺 非递归 二叉树 中序遍历 算法 实现 |
| 文章编号： | 1003-5850（2006）04-0054-03 |
| 收稿时间： | 2005-11-30 |
| 修稿时间： | 2006-03-01 |
Implementation of C++ to Make A Non- recursive Algorithm about Tower of Hanoi |
| |
| He Cunxin.Implementation of C++ to Make A Non- recursive Algorithm about Tower of Hanoi[J].Computer Development & Applications,2006,19(4):54-56. |
| |
| Authors: | He Cunxin |
| |
| Abstract: | Through analyzing the recursive algorithm and result of Hanoi problem,this paper designs the non-recursive algorithm creatively by dint of the data structure of binarytree,and presents the source program of C++ to make the algorithm.This algorithm hasn’t really created the same binarytree physically,and it is different from the traditional binary-tree structure in application |
| |
| Keywords: | Hanoi non - recursive binary - tree inorder traversal algorithm implementation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
