| 释义 |
re·cur·sion 英rɪˈkɜːʒən美rɪˈkɝʒənAHDrĭ-kûrʹzhən 高COCA⁵⁸⁹¹⁶BNC⁶⁴²¹¹iWeb²²³⁸⁵Economist²⁹⁹⁰¹⁺⁴
基本英英搭配记法例句例句
n.循环¹⁰⁰;数递归形容词recursive
Noun:
mathematics an expression such that each term is generated by repeating a particular mathematical operationleft recursion左递归right recursion右递归primitive recursion原始递归simultaneous recursion联立递归limited recursion有限递归法recursion formula递推公式indirect recursion间接递归mutual recursion人工递推simple recursion简单递归recursion instruction递归指令local recursion局部递归recursion programming递归程序设计…
钱博士re回来+curs奔跑+ion名词后缀→跑回来⇒递归，循环
词根curr-奔跑来自拉丁语，和拉丁词根carr-车同源，常见变体形式cur-。它的过去分词形式为curs-，后面的s是过去分词后缀t的音变。re回来+curs奔跑+ion名词后缀→跑回来⇒递归，循环。
名词100%
用作名词This is the reason why we userecursion.但递归方法更优雅，能更好地反映问题的本质。
In order to construct a tree, the first thing you should think of isrecursion.为了构造一个树，第一件你该想的事情就是递归。 And the reason I want to show you this is to notice that the recursion can be doubled.
如果我来写斐波那契数列你可以看看这儿,原因是我想让你看看这部分的递归可以翻倍。163
Finally, for the case of recursive expressions, the parser should simply echo parentheses when it sees them within the expression recursion, as illustrated in Listing21.
最后对于递归表达式的情况，当解析器在表达式递归中看到括号时，就应该简单地进行回送，如清单21中所示。 ibm
The seed or step1 of the recursion.
一部分是递归的种子即第 1步。 ibm
Doing so would be a useful exercise, and a helpful lesson in runaway recursion.
这样做将是十分有用的练习，并且对失控递归非常有用。 ibm
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.
对于列中的给定条目，通过进一步查看后面跟随的条目是否具有更高的递归级别，可以了解它是否具有子代。 ibm
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.
如果具有子代，那么当前条目必须是一个文件夹，您要将其名称和递归级别推到辅助堆栈上并将它们添加到树中。 ibm
In math and engineering, recursion, especially, is a big win.
在数学和工程中，递归获得了重大胜利。 yeeyan
In this prototype implementation, we have employed a modified class loader to support polymorphic recursion.
在该原型实现中，我们使用了一个修改的类装入器来支持多态递归。 ibm
It is possible to write pure SQL statements with complex recursion to do this.
这可以通过编写带有复杂递归的纯 SQL语句来实现。 ibm
It also demonstrates how the recursion of the function execution works.
这也解释了函数执行的递归是如何实现的。 ibm
It eliminates the need to specify recursion explicitly.
它消除了明确地指定递归的需求。 ibm
It prints an end of line and terminates the recursion.
它打印出一行的最后一个字符，然后终止递归。 yeeyan
Later you'll see how recursion takes advantage of these selectors.
稍后，您将了解递归如何利用这些选择函数。 ibm
Left recursion is used so that the rule can be reduced after each message.
为了归约每个消息之后的规则，使用的是向左递归。 ibm
Note also the use of left recursion.
还要注意向左递归的使用。 ibm
Notice, that we show here only the first recursion step, in order not to make example too long.
请注意，我们在这只演示了第一次的递归步骤，只是为了不让例子占太长的篇幅。 yeeyan
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.
可见，递归算法中新奇的一点是,为了实现一个想法,你可以一遍又一遍地做相同的事情,但每次的规模都会有所减小。163
The second part represents the iteration or recursion.
第二部分代表迭代或递归。 ibm
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语句和传统的操作符而不需要使用递归在层次中进行搜索。 ibm
The tool even supports recursion to a given depth.
这个工具还支持递归到给定深度。 ibm
There is one advantage, though: It is sufficient to find any child row that introduces recursion.
这样做有一个优点：它足以发现将引入递归的任何子行。 ibm
This could certainly prove useful for complex programs implementing a great deal of recursion or with complicated loop conditions.
它可以被用来证明极其复杂的，含有大量递归以及循环结构的程序是否有效。 yeeyan
This fact may be obfuscated by our simple example earlier in which the polymorphic recursion occurs as a simple, direct self- reference.
我们先前的简单示例其中，多态递归作为一个简单直接的自引用发生会使这一事实变得模糊。 ibm
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.
为了允许递归，协作结构被嵌套到类的规范中。这就是说这个类的所有实例都将有一个由类定义的内部结构。 ibm
To see an example of when this is especially useful, let's take a look at an example that involves another important aspect of functional programming: recursion.
要了解这一点是多么地有用，可以看看下面这个例子，该例涉及到了函数式语言的另一个十分重要的方面：递归。 ibm
You may be thinking that you know how write this program to perform faster or better without recursion.
您可能会认为自己知道如何不使用递归编写这个程序，使其执行更快或者更好。 ibm
You should be familiar with the following XML- related, computer- science concepts: tree traversal, recursion, and reuse of data.
您应该熟悉下列与 XML有关的计算机科学概念：树遍历、递归和数据重用。 ibm
Recursion allows defining policies higher up in a domain and enforce them on all the component implementations and interactions within.
递归允许在域的更高层定义策略，然后将它们强制到内部所有组件实现和交互。 infoq
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.
在处理一些复杂问题的时候，最常用到的两个方法是递归和叠代，它们直接利用计算机的高速计算能力解决问题。 yeeyan
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.
递归是一门伟大的艺术，使得程序的正确性更容易确认，而不需要牺牲性能，但这需要程序员以一种新的眼光来研究程序设计。 ibm |