摘要
汉诺塔问题这一古典的数学问题是一个典型的递归问题,其递归算法由于简洁清晰,为大家所熟悉,编写出来的程序也比较简单。相比之下,大家对汉诺塔问题的非递归算法比较陌生,本文采用JAVA语言编程实现了汉诺塔问题非递归算法。
Hanoi tower problem is a typical recursion,which we are familiar with.Because the recursion algorithm is concise and legible,the programs using this recursion algorithm are pretty simple too.Compared with the reeursion algorithm,we are not familiar with the non-recursive algorithm of Hanoi tower problem.This thesis makes the non-recursive algorithm of Hanoi tower problem come true with JAVA language.
出处
《农业网络信息》
2007年第9期153-154,共2页
Agriculture Network Information
