搜索资源列表
DE
- 用数组模拟递归函数，实现递归函数的简化算法，具体要求看英文描述。-We all love recursion! Don t we? Consider a three-parameter recursive function w(a, b, c): if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns: 1 if a > 20 or b > 20 or c > 20
A_class_of_Linear_ODE_WITH_Finite_Recursion
- 求一类常系数线性常微分方程特解的有限递推法-A class of Linear Ordinary Differential Equations with Finite Recursion
Levinson
- 采用列文逊递推算法求解对称托伯利兹型方程组。其中t存放T型矩阵的元素。b是右端常数向量。x是解向量。n是阶数。-Using Levinson recursion algorithm for symmetric Tuobolizi equations. Where t T-matrix elements of deposit. b is the right end of the constant vector. x is the solution vector. n is the order.
Fullarray
- 3种求解全排列的方法，递归，迭代等，VC++6.0编译通过。-Three kinds of methods of solving the full array, recursion, iteration, etc., VC++6.0 compile.
kalmanintroduction
- In his 1960 famous publication (“A new approach to linear filtering and prediction problems”, Trans.ASME J. Basic Engineering., vol 82, March 1960, pp 34-45), Rudolf Kalman based the construction of the state estimation filter on probability theory,
DiTuiGaoXiaoLv
- 习惯了使用递归，但时间和空间都不是很好，而递推则解决了这个问题，递推不仅能节省时间，空间也是很不错的哦！-Accustomed to the use of recursion, but time and space are not very good, but recurrence is to solve this problem, recursive not only save time, space is also very good oh!
wish
- this sample simulation from omnet++ . how to use recursion in this coding sample-this is sample simulation from omnet++ . how to use recursion in this coding sample
leftrec
- program on left recursion
BinaryTree
- 这是个二叉树的数据结构的各项操作。有二叉树的拷贝，计算树高，树叶等。特别要注意的是用非递归算的。-Binary Tree is not recursion
derangementsRecursion
- A derangement Recursion written in Python
My_fft1
- This function calculates discrate fourier transform for vector using the "Fast" method . (recursion )-This function calculates discrate fourier transform for vector using the "Fast" method . (recursion )
diguidituifa
- 递归法实现猴子吃桃，第十天一个桃子，球第一天的数量，每天吃的数量是前一天数量的一半加一，递归法整数排序-Recursive method to achieve the monkeys eat peaches, the tenth day of a peach, the number of the first day of the ball, eat the day before the number is half the number plus one, sort integer recurs
recursion1
- This a .cpp file. It is a data structure question. Recursion-This is a .cpp file. It is a data structure question. Recursion
stirling
- 离散数学中用递归和递推的方法分别求第二类stirling数.-Discrete mathematics using recursion and recursive methods are seeking second stirling numbers.
Fibonacci
- 这是我自己写的一个斐波拉契数死的程序，有递归法和迭代法-This is what I had written a number of dead Feibolaqi procedures, recursion and iteration! !
syntax
- LL(1)文法的实现。具体设计要求如下： 1. 可以使用任何语言来完成，例如：Java、C、C++。 2. 文法采用常用的方式进行描述，例如：S→aA。 3. 以文件方式读取文法。 4. 分别求出每一个非终结符FIRST 集FOLLOW集和SELECT集。 5. 画出预测分析表。 6. 判定读入的文法是否是LL(1)文法。 7. 给定的任意符号串判定是否是文法中的句子，将分析过程用计算机打印出来。 8. 查出文法中是否含有左递归或左公因子。若有则消除左公因子和左递
bintree
- C++实现求二叉树的深度（递归·非递归）·遍历（递归，非递归）-C++ realization for binary tree depth (recursion · the recursive) · traversal (recursion, the recursive)
BTree 二叉树的遍历与应用
- 二叉树的建立，前序中序后序遍历，线索化，递归非递归遍历，查找前驱或后继结点，输出，菜单实现。-The establishment of a binary tree, inorder preorder postorder traversal, threaded, non-recursive traversal recursion, find precursor or successor nodes, output, menu implementation.
source
- This derivation of the normalised least mean square algorithm is based on Farhang- Boroujeny 1999, pp.172-175, and Diniz 1997, pp 150-3. To derive the NLMS algorithm we consider the standard LMS recursion, for which we select a variable step size
x
- This derivation of the normalised least mean square algorithm is based on Farhang- Boroujeny 1999, pp.172-175, and Diniz 1997, pp 150-3. To derive the NLMS algorithm we consider the standard LMS recursion, for which we select a variable step size