recursion

n. [数] 递归，循环；递归式

n.

递归，递归式；递推；

英英释义

recursion[ ri'kə:ʃən, -ʒən ]

n.(mathematics) an expression such that each term is generated by repeating a particular mathematical operation

词组短语

recursion formula递推公式；[数]递归公式

双语例句

用作名词(n.)

This is the reason why we use recursion.
但递归方法更优雅，能更好地反映问题的本质。

In order to construct a tree, the first thing you should think of is recursion.
为了构造一个树，第一件你该想的事情就是递归。

权威例句

recursion (n.)

1610s, from Latin recursionem (nominative recursio) "a running backward, return," noun of action from past participle stem of recurrere "run back" (see recur).

1. Well, the infinity mechanism, and many of you will be familiar with this from mathematics or computer science, is recursion.

这种无限机制是递归的,你们许多人会在数学与计算机科学中,熟悉这个词

2. Recursion allows defining policies higher up in a domain and enforce them on all the component implementations and interactions within.

递归允许在域的更高层定义策略，然后将它们强制到内部所有组件实现和交互。

3. If so, then the current entry must be a folder, and you push its name and recursion level onto an auxiliary stack as well as adding it to the tree.

如果具有子代，那么当前条目必须是一个文件夹，您要将其名称和递归级别推到辅助堆栈上并将它们添加到树中。

4. It eliminates the need to specify recursion explicitly.

它消除了明确地指定递归的需求。

5. Notice, that we show here only the first recursion step, in order not to make example too long.

请注意，我们在这只演示了第一次的递归步骤，只是为了不让例子占太长的篇幅。

6. The advantage to this new data type is that it allows for searches within the hierarchy with a single SELECT statement, using traditional operators without recursion.

这种新的数据类型的优点是，它允许使用一条SELECT语句和传统的操作符（而不需要使用递归）在层次中进行搜索。

7. It also demonstrates how the recursion of the function execution works.

这也解释了函数执行的递归是如何实现的。

8. To allow recursion, a collaboration structure is nested within a class specification, which means that all instances of that class will have an internal structure specified by the class definition.

为了允许递归，协作结构被嵌套到类的规范中。这就是说这个类的所有实例都将有一个由类定义的内部结构。

9. Note also the use of left recursion.

还要注意向左递归的使用。

10. In mathematics or computer sciences recursion refers to a method of defining functions based on their own definition.

在数学和计算机科学中，递归指的是基于自己 定义 来定义函数的一种方法。

11. It prints an end of line and terminates the recursion.

它打印出一行的最后一个字符，然后终止递归。

12. Finally, for the case of recursive expressions, the parser should simply echo parentheses when it sees them within the expression recursion, as illustrated in Listing 21.

最后对于递归表达式的情况，当解析器在表达式递归中看到括号时，就应该简单地进行回送，如清单21 中所示。

13. There is one advantage, though: It is sufficient to find any child row that introduces recursion.

这样做有一个优点：它足以发现将引入递归的任何子行。

14. The seed or step 1 of the recursion.

一部分是递归的种子（即第 1步）。

15. Left recursion is used so that the rule can be reduced after each message.

为了归约每个消息之后的规则，使用的是向左递归。

16. In this prototype implementation, we have employed a modified class loader to support polymorphic recursion.

在该原型实现中，我们使用了一个修改的类装入器来支持多态递归。

17. And the reason I want to show you this is to notice that the recursion can be doubled.

如果我来写斐波那契数列你可以看看这儿,原因是我想让你看看这部分的递归可以翻倍。

18. Doing so would be a useful exercise, and a helpful lesson in runaway recursion.

这样做将是十分有用的练习，并且对失控递归非常有用。

19. The tool even supports recursion to a given depth.

这个工具还支持递归到给定深度。

20. For a given entry in the list, you can find out if it has children by looking ahead to see if the following entries have a higher recursion level.

对于列中的给定条目，通过进一步查看后面跟随的条目是否具有更高的递归级别，可以了解它是否具有子代。

21. So, the curious thing about recursion is that pretty much always can you implement this idea of doing the same thing again and again and again but with smaller bytes each time.

可见，递归算法中新奇的一点是,为了实现一个想法,你可以一遍又一遍地做相同的事情,但每次的规模都会有所减小。

22. This could certainly prove useful for complex programs implementing a great deal of recursion or with complicated loop conditions.

它可以被用来证明极其复杂的，含有大量递归以及循环结构的程序是否有效。

23. You may be thinking that you know how write this program to perform faster or better without recursion.

您可能会认为自己知道如何不使用递归编写这个程序，使其执行更快或者更好。

24. The second part represents the iteration or recursion.

第二部分代表迭代或递归。

25. Recursion and iteration are two very commonly used, powerful methods of solving complex problems, directly harnessing the power of the computer to calculate things very quickly.

在处理一些复杂问题的时候，最常用到的两个方法是递归和叠代，它们直接利用计算机的高速计算能力解决问题。

26. This fact may be obfuscated by our simple example earlier in which the polymorphic recursion occurs as a simple, direct self-reference.

我们先前的简单示例（其中，多态递归作为一个简单直接的自引用发生）会使这一事实变得模糊。

27. In math and engineering, recursion, especially, is a big win.

在数学和工程中，递归获得了重大胜利。

28. You should be familiar with the following XML-related, computer-science concepts: tree traversal, recursion, and reuse of data.

您应该熟悉下列与XML有关的计算机科学概念：树遍历、递归和数据重用。

29. You should be familiar with the following XML-related, computer-science concepts: tree traversal, recursion, and reuse of data.

您应该熟悉下列与XML有关的计算机科学概念：树遍历、递归和数据重用。

30. The problem arises when the user interface attempts to accurately represent the concepts of recursion, hierarchical data, or multithreading.

当用户界面试图精确地表达递归、层次数据或者多线程这些概念时，问题就出现了。

-- 来源 -- About Face 3交互设计精髓

31. A simple recursion formula can then be used to solve such a system.

一个简单而又重复的公式能用来解这样的方程组。

-- 来源 -- 英汉 - 辞典例句

32. There is a simple recursion formula for πK(G).

关于πK（G）存在一个简单的递推。

-- 来源 -- 英汉 - 辞典例句

33. In BNF, the only way to indicate a list of an arbitrary number of elements is through recursion.

在BNF表示法中，为了表示一串任意个数的元素，唯一的方法是通过递归来定义。

-- 来源 -- 英汉 - 辞典例句

34. generalized recursion theory

广义递归论

-- 来源 -- 英汉 - 短句参考

35. of or relating to a recursion.

递归的、或者与递归相关的。

-- 来源 -- 汉英 - 翻译参考

36. recursion is of unlimited depth;

递归具有无限的深度；

-- 来源 -- 汉英 - 翻译参考

37. nested recursion

嵌套递归式

-- 来源 -- 英汉 - 翻译参考[网络]

38. simple recursion

简单递归

-- 来源 -- 英汉 - 翻译参考[网络]

39. All programmers are fluent in these algorithms, including such things as recursion, hierarchical data structures, and multithreading.

所有的程序员都熟悉这些算法，包括递归、层次数据结构和多线程等。

-- 来源 -- About Face 3交互设计精髓