递归

na.【数】recurrence; recursion

网络释义：recursive; Recurrences; recursively

网络释义

na.1.【数】recurrence; recursion

1.recursion readOnly 只读 recursive 递归 refactoring 重构 ...

3.recurrence 循环, 回归 recurrence 循环, 递推, 递归 recurrence 回归, 递归 recurrence ...

4.Recurrencesowth of Functions） 　　第四章 递归（Recurrences） 　　第五章 概率分析与随机化算法（Probabilistic Analysis and Randomized Al…

5.recursively ... ) recursion 递归 ) recurrent 递归 ) recursive statistics method 递归统计 ...

7.Recurse Interactive 交互 Recurse 递归 ExponentialSquared 指数平方雾 ...

1.The recursive CTE definition must contain at least two CTE query definitions, an anchor member and a recursive member.递归CTE定义至少必须包含两个CTE查询定义，一个定位点成员和一个递归成员。

2.This code uses the concept of recursion to call the main function multiple times until the last directory has been traversed.此代码会利用递归概念多次调用主函数，直至处理完最后一个目录为止。

3.Depth-first walking means that the processor visits all the children of a given node recursively until it has processed the entire document.深度优先遍历意味着，处理器递归访问某一给定节点的所有子代，直到处理了整个文档为止。

4.You may be thinking that you know how write this program to perform faster or better without recursion.您可能会认为自己知道如何不使用递归编写这个程序，使其执行更快或者更好。

5.Well, there is also a possibility of using function names for recursion, but you will soon see that this is often impractical nowadays.当然还有可能在递归调用中使用函数名称，但是你将很快看到在当下他通常不大实用。

6.And thus, the ability to understand pointers and recursion is directly correlated with the ability to be a great programmer.因此，是否真正理解指针和递归，与是否是一个优秀程序员直接相关。

7.Known as lambda calculus, it was designed to investigate the function definition and application, as well as the concept of recursion.它被称为lambda演算，用于研究函数定义与应用程序以及递归概念。

8.Too many method calls is often indicative of a very deep or unbounded recursion.过多的方法调用通常意味着存在非常深的递归或无限递归。

9.Probably the best way to understand is with a real example and to do that, we need a recursive function.可能理解它的最佳途径是接触一个实际的例子，我们需要一个递归函数。

10.The last function you're going to create is going to take some recursion, where the true power of list processing using Lisp lies.将要创建的最后一个函数要执行一些递归操作，这是使用Lisp进行列表处理的真正强大之处。