recursive function

Analysis of recursive function 's time complexity

递归函数时间复杂度的分析

Profitable to say two types of errors transform of a class of recursive function

两类错误谈论有益一类递归函数的转换

A simple reading method for problem of recursive function

函数递归调用问题的简化读程方法

The methods of recursive function for analysis of logical automata

逻辑自动机分析中的递归泛函方法

Recursive function method for machine discovery

机器发现的递归函数法

The Application of Recursive Function

递归函数的应用

Transform of a class of recursive function

一类递归函数的转换

Our next example of a recursive function on lists will be a little more complicated .

我们的下一个基于列表的递归函数示例要稍微复杂一些。

Converting a common loop to a recursive function

将一个常见的循环转化为递归函数

A new appoach for curve fitting based on the basic theoryof recursive function

基于递归函数理论的任意曲线拟合方法的研究

Traversing the Ambiguity Vector Space by Recursive Function

用递归算法实现整周模糊度矢量空间的遍历

You 've implemented a recursive function in Lisp .

您已经在Lisp中实现了递归函数。

The program then seeds the recursive function with the first item on the list and the remaining list .

然后程序以列表中的第一项及其余部分列表为种子开始递归函数。

And now it had turned out that the general recursive function was exactly equivalent to the computable function .

现在可以证明，一般化的递归函数和可计算函数是等价的，

Non-recursive Simulation on Recursive Function

递归函数的非递归模拟

In this program , all state changes are brought about by re-running the recursive function with completely self-consistent data .

在这个程序中，所有状态改变都是通过使用完全前后一致的数据重新运行递归程序而实现的。

When we converted our loop to a recursive function , the recursive call was the last thing that the function did .

当我们将循环转化为递归函数时，递归调用是函数所做的最后一件事情。

Main is a recursive function & it accepts a node set in the current argument and loops over the node set .

main是一个递归函数，它用current参数接受一个节点集并遍历该节点集。

Let 's take a look at a common loop for printing reports and see how it can convert into a recursive function .

让我们来研究一个打印报表的常见循环，了解如何将它转化为一个递归函数。

The second part introduces the way of showing A function , recursive function , procedure function and lists some commonly used Mini-LISP functions .

第二部分介绍λ函数、递归函数及过程函数的表示法，并列举Mini-LISP的常用函数；

Based on the theory of recursive function , this method adopts primitive recursive formula in function representation and is easy to be implemented on computer .

其发现能力也有所提高，该方法采用原始递归式定义函数，递归函数在理论上比较完善，故该方法具有很好的理论依据并且便于计算机实现。

This idea , when formalised and extended somewhat , led to the definition of the ' recursive function ' .

这个想法在哥德尔对不完备性的证明中起到了关键作用，并产生了“递归函数”的定义。

You need to do this because your parameter will get clobbered on the recursive function call , and you will need access to it afterwards .

之所以需要这么做是因为参数会在递归函数调用上被截断，而以后却还需要访问它。

We will be substituting a call to this find () method for our recursive function described previously when we get this new version , and so should you .

获得新版本后，我们将调用这个find（）方法，替代前面介绍的递归函数，您也应该如此。

Goto statements and recursive function calls may be supported by the language definition , but it is known that using other methods makes the code easier to understand .

语言规范可能支持goto语句和递归函数调用，但使用其他方法能够让代码更易于理解。

Examples are given for solving complex problem by transferring variables in recursive function program , and the recursive function programs show excellent capability for solving non-numeral problem .

给出了递归函数调用时利用变量传递解决复杂问题的实例，展示了递归算法在解决非数值运算问题中的独特解题方式和效果。

This recursive function works fine , but it has one main shortcoming & every iteration of the recursion will be passing the same value for the-string .

这个递归函数能很好地工作，不过它有一个主要的缺点&递归的每一次迭代都要为the-string传递相同的值。

In this paper , a recursive function for neural network computation in time domain is derived by means of structural dynamics and then the neural network model for dynamic load identification with time delay is established .

依据结构动力学理论推导了在时域中用于神经网络算法的自回归函数，相应建立了具有时延反馈的神经网络动载荷识别模型。

Walk through these dependencies by writing a recursive function that can find the latest version of a plug-in ( in case duplicate plug-ins are in the same system ) and all its dependencies .

我们可以编写一个递归函数来遍历这些依赖性，它可以查找某个插件的最新版本（针对在相同的系统中有重复插件的情况）以及它的所有依赖性。

At the second , it is not recursive function calls in the whole operation process , so the algorithm has a fixed complexity , increasing of data size will not lead to an overall performance increase of non-linear decline .

其次，它在整个运算过程中没有递归的函数调用，从而使该算法具有固定的复杂度，不会因数据量的增大而导致整体性能非线性下降。