搜索资源列表
wang3
- linux上实现四种排序，分别是选择排序、递归排序、冒泡排序、和快速排序。以及显示程序运行时间-Linux on its four sorting, respectively is choice, sort and recursion sequence, bubble sort, and quick sort. And show program running time on its Linux four sort
recursion
- 这个程序代码是通过递归来实现前n个自然数的和。-This programmer realizes recursively the sum of n natural number.
zjxiangqi
- 马踏棋盘，马子在中国象棋棋盘上实现无返回走回所有路程，采用递归，打印出所有设计方案-Horse riding board on the chess board in China, Ma no return back to the all away, using recursion to print out all design
GLLL1tare
- LL1通用语法分析器，有消除左递归，FIRST集合、FFOLLOW集合、分析表生成等功能，已通过测试。 -LL1 general parser, to eliminate left recursion, FIRST collection FFOLLOW collection, analysis, table generation, has been tested.
remlef
- remove left recursion
Eextjsx
- Extjs 树的递归,树的目目录和节点的递归组装 -Extjs tree recursion, the purpose of the tree directory node recursive assembly
ll1
- LL(1)文法的实现，主要包括文法的读取、消除左递归、求First集、Follow集、Select集，生成预测分析表，对给定句子分析是否符合文法。-LL (1) grammar implementations, read mainly include grammar to eliminate left recursion, seeking First set, Follow Set Select set generate predictive analysis table, analysis m
calculate24
- 利用C语言递归的优点计算24点，输入任意4个数，输出所有可能结果-The advantages of the C language recursion 24 points, enter any number 4, the output of all possible outcomes
main.cpp
- An Effective algorithm for calculating exponentiation by using recursion
Assignment2-vs2008
- 程序设计课程，三个程序，包ListCompletions，SierpinskiTriangle，Boggle用于练习递归的运用。-Programming courses, three program packages ListCompletions SierpinskiTriangle Boggle used to practice the use of recursion.
data15
- 汉诺塔的实现，不用递归，可以实现两位数的汉诺塔-The realization of HANOR without recursion, can achieve double-digit HANOR
RLS
- a recursion least square algorithmn
PA7a
- ReverseRecurse.java: Write an application that reads integer values from the keyboard into an array whose size is specified by the user (the user may enter fewer integers than the size Start Early!!! specified, but not more) and reverse t
hw3-Hannoi
- 数据结构中汉诺塔问题的递归解法。原题中为链表解决。但是较为繁琐，使用递归较快解决。配合清华版数据结构书。-Data structure in the Tower of Hanoi problem recursive solution. Solve the original title for the linked list. But more cumbersome to use recursion to solve faster. The data structure of the book w
Eight_Queen
- 递归解决八皇后问题使用的是VS2010（编译通过）代码有注释说明. 有两种方法解决-Recursion to solve the eight queens problem using VS2010 (compiled by) code annotated There are two ways to solve
RSNA
- 待辨识对象参数a=[1 -1.5 0.7] b=[1 0.5] 输入采用长度L=400的白噪声序列，输出 ，输入和输出数据均含不相关随机噪声，ρ（k）=1/k。利用上述递推公式，辨识系统参数。-To identify the object parameters a = [1-1.5 0.7] B = [1 0.5] Input the length L = 400 white noise sequence, the output, the input and output data
RELS
- 增广最小二乘的递推算法对应的噪声模型为滑动平均噪声，扩充了参数向量和数据向量H（k）的维数，把噪声模型的辨识同时考虑进去。最小二乘法只能获得过程模型的参数估计，而增广最小二乘法同时又能获得噪声模型的参数估计，若噪声模型为平均滑动模型，，则只能用RELS算法才能获得无偏估计。当数据长度较大时，辨识精度低于极大似然法。-Augmented least squares of recursion algorithm corresponding noise model for moving average
RFF
- 辨识模型与遗忘因子法所用模型相同，其中， 0 ≤μ≤1为遗忘因子， 此处取0.98。 数据长度L=402。一次算法和递推算法结果基本一致，但递推算法可以实现在线实时辨识，而且可以减少计算量和存储量。-Identification model and forgetting factor method used the same model, among them, 0 or less or less 1 μ for forgetting factor, here take 0.98. Data l
Determinant-calculation
- 关于行列式计算的C源代码，用的是行列式展开法，用到了递归，很完善，值得参考-Determinant calculation of C source code, with determinant expansion method, use recursion, it is perfect, it is worth Reference
FagInterfaz
- Full Avaiabiliti Group Network Kaufmann Roberts Recursion calculator