浅谈递推法在程序设计中的应用

Discussion on the application of the recursion law in the programming

递推法是青少年信息学竞赛必须掌握的一种方法,也是程序设计教学过程中不可缺少的环节。递推是迭代算法中的一种用若干步可重复的简单运算来描述复杂数学问题的方法。解决递推问题必须找到两个关系:初始条件和递推公式,其中建立递推公式是解题的关键,编程时通常采用循环的办法来实现递推算法。

Recursion is not only an important method which should be mastered by the middle school students in information science competitions, but also necessary in teaching progamming. The recursion arithmetic is to use some steps of simple repeated calculation to describe the complex problems. Two relations must be found out in solving recursion problems： the original condition and the recursion formula, and the second one is the key. man usually uses loops to implement recursion arithmetic.