Recursion is a great art, enabling programs for which it is easy to verify correctness without sacrificing performance, but it requires the programmer to look at programming in a new light.
递归是一门伟大的艺术，使得程序的正确性更容易确认，而不需要牺牲性能，但这需要程序员以一种新的眼光来研究程序设计。
Note that this is classical functional programming, relying on recursion over iteration.
请注意这是典型的功能性编程，取决于迭代上的递归。
For those of you who are new to computer programming, here's a simple definition of recursion: recursion occurs when a function calls itself directly or indirectly.
对刚开始接触计算机编程的人而言，这里有递归的一个简单定义：当函数直接或者间接调用自己时，则发生了递归。
You should also be familiar with general programming techniques such as iteration and recursion.
还应该熟悉一般的编程技术，如迭代和递归。
Dynamic programming is used when recursion could be used but would be inefficient because it would repeatedly solve the same subproblems.
在可以使用递归，但因为递归重复解决相同的子问题造成效率低下的时候，则可以采用动态编程。
In these foundations, the recursion theory of depth first traversal, database technology and visual programming technology are employed to computer memory, which is expressed to node relations.
在此基础上，采用深度优先遍历的递归理论和数据库技术，实现了流域节点间关系的计算机存储。
And this too is where the power of recursion comes in in a programming language.
这也是在编程语言中，对递归很有影响的一点。
As in almost any programming language, you can use functions to group pieces of code in a more logical way or practice the divine art of recursion.
对于大多数编程语言，你都可以调用函数来执行一段代码，这样可以使用减少重复的书写代码。
As in almost any programming language, you can use functions to group pieces of code in a more logical way or practice the divine art of recursion.
对于大多数编程语言，你都可以调用函数来执行一段代码，这样可以使用减少重复的书写代码。
应用推荐