归程走的是同一路线。
道格拉斯：祝你们归程一路平安。
渴望踏上归程爱让我永不放弃。
答案就是它使用一个递归程序。
每一个递归程序都遵循相同的基本步骤。
Every recursive program follows the same basic sequence of steps.
计算阶乘是递归程序设计的一个经典示例。
The classic example of recursive programming involves computing factorials.
我就将踏上归程，等等我！
绕道似最远，归程是捷径。
归程走的是同一路线。
有时候，编写递归程序时难以获得更简单的子问题。
Sometimes when writing recursive programs, finding the simpler sub-problem can be tricky.
我们为什么不考虑堆栈帧的大小而递归程序计算的空间复杂度？
Why don't we consider stack frame sizes while calculation Space Complexity of recursive procedures?
本文提出递归程序变换模式的一般设计方法，并以具体示例说明之。
In this paper, a gerenal designing method for the patterns of recursive program transformation is presented, and some related examples are given.
1621年的今天，“五月花”号从普利茅斯起程踏上前往英国的归程。
1621 - The Mayflower sets sail from Plymouth on a return trip to Great Britain.
血清中瘦素的测定，有可能作为病毒性肝炎患者转归程度判断的一个指标。
So the concentration of leptin might be a candidate index for evaluating the progresses of viral hepatitis patients.
本文介绍一种应用pc—1500微机进行可化为线性回归分析的曲线回归程序。
A kind of program used on PC-1500 microcomputer to carry out curvilinear regressive analysis that can be transformed into linear regressive analysis is presented.
采用世代平均值分析的多元回归程序，对家蚕耐氟性状的基因效应参数进行了估计。
Based on the multiple regression procedure for the generation mean analysis, gene effects of fluoride resistance in silkworm were studied.
本文介绍了计算机系统将递归程序转换为非递归程序的方法，并举例说明如何手工应用。
This article introduces how the computer system transforms recurrence programs into non-recurrence programs, and gives two examples showing how to make use of it.
据报道，一些留学生已经倡议取消他们的归程来把祖国遭受病毒肆虐的危险性降到最小。
It is reported that some have made proposal that overseas students cancel their schedule to go home during holidays so as to minimize the risk of plague in their motherland.
在这个程序中，所有状态改变都是通过使用完全前后一致的数据重新运行递归程序而实现的。
In this program, all state changes are brought about by re-running the recursive function with completely self-consistent data.
注意，与我们的递归程序非常类似，链表的定义也包括一个基线条件——在这里是NULL指针。
Notice how like our recursive programs, the definition of a linked list also contains a base case — in this case, the NULL pointer.
不过，随着程序越来越复杂，递归程序设计能够让程序员以可维护且逻辑一致的方式更好地组织代码。
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.
在繁忙中挤出点时间吧，读读它——《艰难的归程》，你的生命将充盈活力，你的人生将不会后悔！
Spare time from your busy schedule and enjoy the reading - the Hard Journey Home. Your life will be filled with energy again and you won't forget it!
注意，与我们的递归程序非常类似，链表的定义也包括一个基线条件 ——在这里是NULL指针。
Notice how like our recursive programs, the definition of a linked list also contains a base case -- in this case, the NULL pointer.
这样做允许我们简单的描述过程，但是仍然能够通过RUP生命周期的递归程序，建造十分复杂的计划。
This permits one to describe the process simply, but still be able to construct plans of arbitrary complexity by recursive application of the RUP lifecycle.
由于NULL指针会结束一个链表，所以我们也可以使用 NULL 指针条件作为基于链表的很多递归程序的基线条件。
Since a NULL pointer terminates a list, we can also use the NULL pointer condition as a base case for many of our recursive functions on linked lists.
如果开发人员归程序经理管辖，在争论中的某些点上程序经理就会对整件事感到厌倦，说出“好啦，说的够多了，现在就按我说的做！”的话。
If developers report to the program manager, at some point during the debate the program manager is going to get sick of the whole thing and just say, "OK, enough talking, now we do it my way."
讨论了递归程序设计的公式化方法，指出现有方法的不足，并提出了一种新的基于求解状态的递归程序设计公式化方法，在一定程度上达到了递归程序设计公式化、简单化的目的。
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.
讨论了递归程序设计的公式化方法，指出现有方法的不足，并提出了一种新的基于求解状态的递归程序设计公式化方法，在一定程度上达到了递归程序设计公式化、简单化的目的。
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.
应用推荐