Hanoi塔问题递归算法的一种改进

An Improvement of the Recursion to Hanoi Tower Problem

Hanoi塔问题是一个古典的数学问题,在C程序设计中常用递归算法去分析处理。但由于其递归算法中有两次递归调用,其程序执行的具体过程很复杂,很难直接看出其调用过程。本文通过运用堆栈概念深入分析Hanoi塔问题递归过程并修改其通用的C程序递归算法,使其递归算法程序执行过程具有直观易于理解性,对深入理解和灵活运用递归算法有积极意义。

The problem of Hanoi Tower is a classical mathematic one, which is solved with recursion in C-program. This paper is to analyze the process of recursion with the concept of storehouse, and revise the general recursion in C-program so as to make it directive and easy to understand.