本文为您带来递归的英文翻译，包括递归用英语怎么说，递归用英语怎么说，递归的英语造句，递归的英文原声例

本文为您带来递归的英文翻译，包括递归用英语怎么说，递归用英语怎么说，递归的英语造句，递归的英文原声例句，递归的相关英语短语等内容。

递归的英文翻译，递归的英语怎么说？

递归的英语网络释义

所谓递归(Recursion),就是方法调用自身,对于递归来说,一定有一个出口,让递归结束,只有这样才能保证不出现死循环.

...列的定义如下： 预备知识： 在需要重复地多次计算相同的问题，通常可以选择递归或循环（迭代）两种不同方法。 递归（recursive）：在一个函数内部调用这个函数自身。可以通过栈实现的，本质是把一个问题分解成两个或多个小问题。

5.1 递归(Recurve)的概念 1．递归的定义是： 若一个对象部分地包含它自己，或用它自己给自己定义，则称这个对象是递归的; 而且若一个过程直接地或间...

递归的汉英大词典

递归[dì guī]

• {数} recurrence; recursion
• 短语:
  • 递归程序 [计] recursive program;
  • 递归程序模式 recursive program scheme;
  • 递归程序设计 recursive programming;
  • 递归定理 recursion theorem;
  • 递归定义变量 （计） recursively defined variable;
  • 递归法 {数} recurrence [recursive] method;
  • 递归过程 recursive procedure;
  • 递归函数论 recursive function theory;
  • 递归宏功能 recursive macros;
  • 递归解 {数} recursive solution;
  • 递归类 {数} recurrent class;
  • 递归模式 recursive schema;
  • 递归算术 {数} recursive arithmetic;
  • 递归谓词 {数} recursive predicate;
  • 递归方程 {数} recursion equation;
  • 递归分析 {数} recursive analysis;
  • 递归公式 {数} recurrence formula;
  • 递归估计 {数} recursive estimation;
  • 递归函数 {数} recursive function;
  • 递归计算 {数} recursive computation;
  • 递归滤波 recursive filtering;
  • 递归文法 {计} recursive grammar;
  • 递归线性回归{数} recursive linear regression;
  • 递归序列 {数} recursive sequence;
  • 递归子程序 recursive subroutine

递归的英语短语

递归的英文例句

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

The tool even supports recursion to a given depth.

相似的问题还包括过多的递归。

A similar problem is too much recursion.

使用递归可以极度简化程序的核查。

Using recursion tremendously simplifies the verification of programs.

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

Note also the use of left recursion.

这语言甚至都不支持递归。

That language didn't even support recursion.

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

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

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

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

如果你还不明白什么是递归，就读这个句子。

If you still don't know what recursion is, read this sentence.

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

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

这是递归的停止条件。

This is the stop condition for the recursion.

简言之，NOCYCLE防止递归进入循环。

In short, NOCYCLE prevents the recursion from entering a cycle.

那么如何将其绑回到递归组合中呢？

So how does this tie back in to recursive composition?

递归方法也需要显式的返回类型。

Recursive methods also require an explicit return type.

递归式遍历JSF组件树。

Traversing the JSF component tree recursively.

每个问题的解都能用递归关系表示。

The solution to each of them could be expressed as a recurrence relation.

静态禁止多态递归。

Statically forbid polymorphic recursion.

我使用目录技术来处理这种递归引用。

I use a directory approach to handle these recursive references.

这就是一个绝妙的递归定义。

It's actually a wonderful recursive definition.

处理器实现了一种递归算法。

The processor implements a recursive algorithm.

步骤3和步骤4是递归搜索。

Steps 3 and 4 are recursive searches.

使用归纳数据编写递归过程非常简单。

With inductive data, it is fairly easy to write recursive procedures.

递归的系统分解和从抽象到具体的转换。

Recursive system decomposition and transformation from the abstract to the concrete.

通常，用户不会有意创建递归流程模型。

Usually, users do not intentionally create recursive process models.

对于递归表达式的情况，随之发出括号。

For the recursive expression case, emit the parentheses as is.

现在递归这个词并不新鲜。

Now, this is really not new.

查询可以具有两种类型：递归和非递归。

Queries can be of two types: recursive and non-recursive.

软件架构可以递归地使用。

Software architecture can be used recursively.

这将允许匿名递归函数。

This allows for anonymous recursive functions.

使用获取参数的递归模板可以解决此问题。

A recursive template taking a parameter solves this problem.

如可用，则递归地继续该对象的属性计算。

If available, the attribute evaluation for this object continues recursively.

递归的原声例句

In week zero, when we tore the phonebook in half and half and half we were recursing through that problem.

当我们将电话簿划分为一半又一半的时候,其实就是利用递归在解决问题。

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

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

What's the point of this? Again, now that I can think about things recursively, I can similarly break things down into simpler versions of the same problem. It could be one version.

这些的意思是什么呢？再一次我想说,我既然能够以递归的方式思考了,那么我就可以简单地把问题,转化为更简单的同类问题。

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.

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

This sentence expands to a noun followed by a verb followed by a sentence and there you get recursion.

这个句子就扩展成了,一个名词,后跟一个动词,再接刚才的句子,这样就变成了递归

But that's also nice,it lets you see how the recursive thing is simply unwrapping but the complexity in terms of the amount of time it takes is going to be the same.

它让我们看到了，在复杂度依照时间总数来看,没有变化的情况下,递归是怎么一步步的展开的,我欠你一个糖，谢谢。

And I'm going to show you an example in a 1 second, just to drive this home, but notice the characteristics. In the first two cases, the problem reduced by 1 at each step.

在前面两个例子里,每一部问题的规模缩小了,不管是迭代的还是递归的，这表明这个问题的复杂性可能是线性的。

It could be multiple versions. And we're going to come back throughout the term to think about how to code programs that reflect this.

可能是一种形式也可能是多种形式,我们再回到递归这个术语上来,用它来思考怎样编出。

So this is very similar, this is a kind of recursive thinking we talked about earlier, where we take our problem and we make it smaller we solve a smaller problem, et cetera.

我们则跳过比猜想数小的那个区间,然后我们重复这一过程,跟之前我们讲过的，递归思想非常类似,我们解决问题的时候,先把问题一步步变小，然后解决小问题。

And the idea behind recursion I'm going to describe with a simple example. And then I'm going to show you how we can actually use it.

但是为了解释递归的意义,我想举个简单的例子,我将会给你们展示我们该如何使用它。

This is another way of doing exponentiation, but this one's a recursive function. All right?

但这是一种递归的方法对不对？,好，让我们看看这种方法？

And this is obviously a toy example but you could see the use of recursion in everyday life and in everyday use of language.

这只是个小例子,但在日常生活和日常用语中,递归的应用极为广泛

The last point I want to make to you is, you've started writing programs that you would think of as being inherently iterative.

能反映递归特性的程序，我最后一点想说的是,你已经开始编写你认为。

This is actually a piece of code that is really easy to think about recursively and is much more difficult to think about in other ways.

这确实是一段用递归思考起来非常容易,而其它方法特别麻烦的代码,这一段代码的意思就是。

And this too is where the power of recursion comes in in a programming language.

这也是在编程语言中,对递归很有影响的一点。

There are other problems that are much more naturally thought of in a recursive fashion.

有一些问题不递归,也可以很简单的解决。

How do you know that your parents, at least one of your parents satisfies the definition? Well I've reduced the problem from am I a natural born US citizen to is one of my parents a natural born US citizen?

这是一个递归的定义，你怎么知道你的父母,至少其中一个是满足天生的美国公民,这个定义的呢？,我已经把我是一个天生的美国公民这个问题？

We saw some quadratic algorithms, typically those are things with multiple nested loops, or iterative or recursive calls, where you're doing, say, a linear amount of time but you're doing it a linear number of times and so it becomes quadratic, and you'll see other polynomial kinds of algorithms.

我们看过一些平方算法，他们一般进行了多次嵌套循环,或者递归迭代调用，对一个线性操作调用线性次,这样就变成平方次了,以后你们能看到,一些多项式算法。

All right, I want to show you one last example of using recursion because we're going to come back to this. This is a classic example of using recursion. And that is dating from the 1200s and it is due to Fibonacci.

并且返回答案,我想给你看看递归的最后一个例子,因为我们还要再看一遍,这是一个递归的经典案例,它可以追溯到13世纪。

5 recursive calls to get there.

5次递归调用,才得到这个答案。

fib Roughly speaking, the analysis of fib is actually quite complex, of a recursive fib.

简单的说,递归的fib的分析实际上非常复杂。

Because the algorithm I proposed is going to leverage this idea of recursion which recall was just a piece of jargon we tossed out at the last-- at the end of last week's lecture, last time's lecture recursion really in this context refers to the act of a function calling it's self.

因为我提出的这种算法使用了,递归的思想，这是上周课程的最后,所提出的一个术语，上次的课程中，递归是指,函数的自我调用。

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

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

All right, this is what's called a recurrence relation, there are actually cool ways to solve them. We can kind of eyeball it.

好，这就是所谓的递归关系,也就是解决问题的相当好的办法,我们可以来看看。

But I want to stress again, as long as I do the base case right and my inductive or recursive step reduces it to a smaller version of the same problem, the code will in fact converge and give me out an answer.

就开心的去做吧,但是我想再次强调,只要基础事件处理正确而我的递归,或递推步骤能把它简化为更简单的同类问题,那么这段代码就可以收敛。

We're going to see variations of this, we're going to see a variation of it called recursion, a little later on, but for now we're just going to talk about how do we do iterations.

我们稍后会去，看它的变量,它的所谓的递归数的变量，但是现在我得先讲讲,怎么来实现迭代。

Not so easy to see. All right, but this is actually a great one of those educational moments. This is a great example to think recursively. If I wanted to think about this problem recursively- what do I mean by thinking recursively?

看不太出来，好，但实际上是一个有教育意义的时刻,这是一个很好的关于递归的例子,如果我用递归的思想,去考虑这个问题-,我该怎么用递归去解决这个问题呢？

All right, any questions about that. Yeah?

递归调用来解决其他问题？

递归的网络释义

递归 程序调用自身的编程技巧称为递归（ recursion）。递归做为一种算法在程序设计语言中广泛应用。一个过程或函数在其定义或说明中有直接或间接调用自身的一种方法，它通常把一个大型复杂的问题层层转化为一个与原问题相似的规模较小的问题来求解，递归策略只需少量的程序就可描述出解题过程所需要的多次重复计算，大大地减少了程序的代码量。递归的能力在于用有限的语句来定义对象的无限集合。一般来说，递归需要有边界条件、递归前进段和递归返回段。当边界条件不满足时，递归前进；当边界条件满足时，递归返回。

以上关于递归的英语翻译来自英汉大词典，希望对您学习递归的英语有帮助。