英语释义

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

片语

recursion loop递归循环

indirect recursion[计]

backward recursion向后追溯

infinite recursion无限递归

Recursion Resolution第一种叫递归解析

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

Recursion algorithm递推算法

recursion scheme递归方案

recursion termination递归终止

Tail Recursion[计] 尾递归

英汉例句

• 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.

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

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

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

• 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.

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

• later you'll see how recursion takes advantage of these selectors.

  稍后，您将了解递归如何利用这些选择函数。

• and the reason i want to show you this is to notice that the recursion can be doubled.

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

• 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.

  递归是一门伟大的艺术，使得程序的正确性更容易确认，而不需要牺牲性能，但这需要程序员以一种新的眼光来研究程序设计。

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

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

• 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.

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

• left recursion is used so that the rule can be reduced after each message.

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

• we will get to the speed and space issues of recursion later on.

  稍后我们会讨论递归的速度和空间问题。

• recursion is his middle name, and he tweaks every block of code to perfection, regardless of timelines or readability.

  对递归理论的应用是他的显着特征，对于编码他追求细节，力求完美，毫不考虑时间和可读性。

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

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

• it is possible to write pure sql statements with complex recursion to do this.

  这可以通过编写带有复杂递归的纯sql语句来实现。

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

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

• it also demonstrates how the recursion of the function execution works.

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

• pointers and recursion require a certain ability to reason, to think in abstractions, and, most importantly, to view a problem at several levels of abstraction simultaneously.

  指针和递归要求一定水平的推理能力、抽象思考能力，以及最重要的，在若干个不同的抽象层次上，同时审视同一个问题的能力。