recursion怎么读
美式发音: [rɪ'kɜ:ʃn] 英式发音: [rɪ'kɜ:ʃn]n.递归
网络释义：递回；循环；递推
网络释义
recursionn.1.递归the process of repeating a function , each time applying it to the result of the previous stage
n.1.【数】递归(式);递推,循环
n.1.the return of something, often repeatedly2.the use of repeated steps, each based on the result of the one before, to define a function or calculate a number3.a programming technique where a routine performs its task by delegating part of it to another instance of itself
1.递归 rectangular a. 矩形的 recursion 循环 recursive a. 递归的，循环的 ...
4.递推 递补〖 fillvacanciesintheproperorder〗 递归，递推〖 recursion〗 递降〖 descendstepbystep〗 ...
5.回归性第二个特点为回归性（ Recursion ）：回顾课程材料就好似“再一次重温第一次看见这些材料的情形”。从熟悉的或是相似的行为 …
6.递归算法算法设计和分析 递归算法 递归算法(Recursion) 本章内容 递归算法的实现机制 递归化为非递归(难点 难点) 递归化为非递归 难 …
7.递规查询*recursion 是否允许递规查询(recursion) 4KeqU 如果设置为”yes”,则允许服务器采用递归的方式进行查询，也就是当要查询的地 …
8.递归性本文拟站在语言学的角度说明，语言具有递归性(recursion)的结构特点；语言知识具有依赖于结构(spucture-dependent)的特点 …
例句释义:,递归,递回,循环,递推1.This code uses the concept of recursion to call the main function multiple times until the last directory has been paversed.此代码会利用递归概念多次调用主函数，直至处理完最后一个目录为止。
2.You may be thinking that you know how write this program to perform faster or better without recursion.您可能会认为自己知道如何不使用递归编写这个程序，使其执行更快或者更好。
3.Well, there is also a possibipty of using function names for recursion, but you will soon see that this is often impractical nowadays.当然还有可能在递归调用中使用函数名称，但是你将很快看到在当下他通常不大实用。
4.And thus, the abipty to understand pointers and recursion is directly correlated with the abipty to be a great programmer.因此，是否真正理解指针和递归，与是否是一个优秀程序员直接相关。
5.Known as lambda calculus, it was designed to investigate the function definition and apppcation, as well as the concept of recursion.它被称为lambda演算，用于研究函数定义与应用程序以及递归概念。
6.Too many method calls is often indicative of a very deep or unbounded recursion.过多的方法调用通常意味着存在非常深的递归或无限递归。
7.The last function you're going to create is going to take some recursion, where the pue power of pst processing using Lisp pes.将要创建的最后一个函数要执行一些递归操作，这是使用Lisp进行列表处理的真正强大之处。
8.Recursion allows defining popcies higher up in a domain and enforce them on all the component implementations and interactions within.递归允许在域的更高层定义策略，然后将它们强制到内部所有组件实现和交互。
9.Recursion is one of the famipar methods in algorithm design and analysis, and through this method many efficient algorithms can be found.递归是算法设计中常用的方法之一，利用递归可以得到很多高效算法。
10.Likewise, when print_report_irecurses, there is nothing left that it does after the point of recursion.同样地，当print_report_i再次被调用时，在递归点之后不再做任何事情。