递推关系在算法分析中的应用

The Application of Recursive Relation in the Arithmetic Analysis

递归问题是计算机高级语言程序设计课程中的重点和难点问题，解决该问题时往往缺乏必要的理论依据．利用组合数学中的速推关系可以从理论上深入理解并方便地处理该问题．本文以Ｈａｎｉｏ塔问题为例，对递推关系进行探讨，并通过Ｃ程序进行了验证．结果表明，利用递推关系解决递归问题是可行的．

Recurrence is a key and difficult problem in course of high-level computer language program design. The essential theoretical foundation is often lacking in process of solving this kind of problem. But this sort of problem can be deeply and theoretically understood and handled by combination mathematics. The recurrence is discussed and verified through C's procedure by using the question of the Hanio in this paper. The result indicates that it is practicable to resolve recurrence by using recursive relation.