计算阶乘是递归程序设计的一个经典示例。
The classic example of recursive programming involves computing factorials.
不过，随着程序越来越复杂，递归程序设计能够让程序员以可维护且逻辑一致的方式更好地组织代码。
But as programs become more complex, recursive programming gives the programmer a better way of organizing code in a way that is both maintainable and logically consistent.
讨论了递归程序设计的公式化方法，指出现有方法的不足，并提出了一种新的基于求解状态的递归程序设计公式化方法，在一定程度上达到了递归程序设计公式化、简单化的目的。
Formula method of recursive programming is discussed. The imperfectness of the present method is pointed out, and a new formula method of recursive programming based on solving state is proposed.
应用推荐