| HANOI塔问题求解 |
| |
| 引用本文： | 姚文勇,李帮正.HANOI塔问题求解[J].绵阳师范学院学报,1999(2). |
| |
| 作者姓名： | 姚文勇 李帮正 |
| |
| 作者单位： | 德阳教育学院 德阳618000 |
| |
| 摘 要： | 对“梵塔”问题的递归和非递归解进行了讨论;提出了较递归解法更好的非递归解法;给出了非递归解法的C语言程序.
|
| 关 键 词： | 梵塔问题 递归解 非递解 C语言程序 |
A Discussion of Hanoi Tower Problem |
| |
| Yao Wenyong,Li Bangzheng.A Discussion of Hanoi Tower Problem[J].Journal of Mianyang Normal University,1999(2). |
| |
| Authors: | Yao Wenyong Li Bangzheng |
| |
| Abstract: | The paper discusses both of the recursive and non - recursive solution of the Hanoi problem and delivers a non - recursive solution, which is better than the existed recursive one. All the source programs are given in C language. |
| |
| Keywords: | Hanoi tower problem recursive solution non - recursive solution C Language program |
| 本文献已被 CNKI 等数据库收录！ |
