搜索资源列表
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
TowersofHanoi
- classic game of recursion, tower of hanoi
Greatest-common-divisor-(GCD)
- 用递归调用和辗转相除法求两个整数的最大公约数（输入多组数据，每个数在1到1000之间；输出为一行一个公约数）。-Calculate and output the greatest common divisor (GCD) of a pair of integers.The classic algorithm for computing the GCD, known as Euclid’s algorithm, goes as follows: Let m and n be variables c
Linear-Prediction
- Linear Prediction using Levinson Durbin Recursion and Lattice Filters
MergeSortTest
- 用C++实现了非递归归并排序算法，20万条数据花费时间78ms, 对初学算法的有一定的帮助！-use C++ language to implemente the merge sort algorithm without recursion! This algorithm only cost 78ms to manage 200000 data items.
maze
- 建立一个迷宫，并用递归算法找出一条走出迷宫的路线。-Build a maze and find a way out with recursion method.
Job_exercise1
- 同质链表以及异质链表，主要包括创建、插入、删除、倒置、拼接等操作。-homolinkedlist and heterolinkedlist，including creation，insertion，deletion，recursion，combination
Fibonacci-series
- 斐波那契数列 递归调用，主要用于了解递归用法-The Fibonacci series recursive calls, mainly used to understand recursion usage
CPP
- 列出了C++基本算法的一些源代码如递归，跳转-Listed C++ basic algorithm source code, such as recursion, jump
Nqueen
- 给出了用三种方法实现的N皇后，包括循环、递归、位运算等，方便初学者进行研究学习。-Three ways to achieve the N-Queens, including loops, recursion, bit operation, easy for beginners to study learning.
hierarchicalCentroid
- Descr iptor for simple shapes (e.g letters). Computes the descr iptor twice in order to describe horizontally and vertically with the same accuracy. Input: image (2-D, binary or gray) depth of recursion (default 7), plotFlag(if on -
kuai_suan_24
- 小时候玩过的加减乘除快算24游戏。这里的算法不是用的正统的递归或穷尽。 -The child played the addition and subtraction multiplication and division as fast as count 24 games. Here algorithm is not used in orthodox recursion or exhaustive.
hw2
- c語言教學手冊 第三版 第四章 關於迴圈以及遞迴的習題解答-c language teaching manual for the third chapter on loops and recursion exercises answer
Large-integer-factorial
- 本实例实现了一个计算大整数阶乘的程序。通常使用递归来计算一个整数的阶乘。但是， 因为ii.算本身能够表示的最大整数是有限的，所以能够计算的阶乘整数要受到限制。本程序使 用数组来存储结果，因而很好地解决了这个问题,只要有足够大的数组就能计.任意大的整数0-Examples of the realization of a to calculate large integer factorial program. Usually use recursion to calculate the facto
suanfa
- 算法程序与设计试验中的经典算法的源代码：像是分治递归，贪心，回溯等。-Algorithm design test of the classical algorithm source code: such as divide and conquer recursion, greedy, backtracking.