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.
英
美
- 摘要汉诺塔问题这一古典的数学问题是一个典型的递归问题,其递归算法由于简洁清晰,为大家所熟悉,编写出来的程序也比较简单。