| 汉诺塔问题的非递归算法设计及可视化实现 |
| |
| 引用本文： | 彭伟.汉诺塔问题的非递归算法设计及可视化实现[J].武汉船舶职业技术学院学报,2011(6):55-59,72. |
| |
| 作者姓名： | 彭伟 |
| |
| 作者单位： | 武汉城市职业学院 |
| |
| 基金项目： | 湖北省教育科学立项课题,编号:2009B349 |
| |
| 摘 要： | 讨论了汉诺塔问题的经典递归算法,并基于二叉递归树对算法进行研究,得出了一种不使用堆栈技术的非递归解法,最后在.NET可视化开发环境下设计程序,分别用递归与非递归算法求解指定规模的汉诺塔问题,动态模拟了求解过程中盘片的移动效果。
|
| 关 键 词： | 汉诺塔 二叉树 递归 非递归 可视化 模拟 |
Research on Non-recursion Algorithm of Hanoi and Its Visual Implementation |
| |
| PENG Wei.Research on Non-recursion Algorithm of Hanoi and Its Visual Implementation[J].Journal of Wuhan Institute of Shipbuilding Technology,2011(6):55-59,72. |
| |
| Authors: | PENG Wei |
| |
| Institution: | PENG Wei (Wuhan City Vocational College,Wuhan 430064,China) |
| |
| Abstract: | This essay introduces the classic recursive algorithm of the famous Hanoi,and then carries out further analysis and study on the algorithm based on the binary recursive tree to get a non-recursive solution without using the stack technology.Finally,designing procedures of development environment are visualized in NET,using recursive and non-recursive algorithm respectively to solve Hanoi of specified scale,with the moving effects of disc being dynamically simulated. |
| |
| Keywords: | the tower of Hanoi binary tree recursive non-recursive algorithm visualization simulation |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
