搜索资源列表
EightQueensProblem
- 在8*8的国际象棋盘上放置八个皇后，使其不能互相攻击，用递归法求出所有布局-8* 8 placed on the international chess board eight queens, so that it can not attack each other, all the layout obtained by 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 )
exe5
- 分别用递归实现无限级的菜单、快捷菜单和树形控件显示。-Respectively infinite recursion level menu, shortcut menu, and tree controls display.
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
CG_C
- C字曲线，也就是皇冠。程序运行后，输入一个自然数，计算机则描绘出该递归深度的“C”字曲线。-C shape curve, which is the crown. Running the program, enter a natural number, the computer is depicted in the recursion depth " C" shape curve.
recursion
- 用vc2008创建的一个递归模型，程序里面注释的部分去掉就是一个赛平斯基垫片程序。-Created using a recursive model vc2008, procedures which remove the comment part of the gasket is a race Lipinski program.
recursion1
- This a .cpp file. It is a data structure question. Recursion-This is a .cpp file. It is a data structure question. Recursion
chinachess
- 自己编写的中国象棋。c语言编写。通过枚举法，遍历一定深度中的所有情况，递归深度可以在代码中修改。没有棋盘的库，每步均为即时计算所得。-I have written in Chinese chess. c language. By enumeration, traversing a certain depth in all cases, recursion depth can be modified in the code. No library board, each step are calc
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_Analysis-LL(1)-LCC
- 编译原理之语法分析LL（1） （1）消除左递归 （2）求First集 （3）求Follow集 （4）预测分析表 （5）预测分析过程-Compiler theory of parsing LL (1) (1) elimination of left recursion (2) Find First Set (3) Find Follow set (4) prediction of sheet (5) prediction analysis
LL1parserVS2010
- LL1语法分析器，FIRST集合的构造，FOLLOW集合的构造，消除左递归，预测分析表 C++语言开发，工具VS2010-LL1 parser, FIRST set of the structure, FOLLOW set of the structure, elimination of left recursion, predictive analysis table C++ language development tools for VS2010
GrammerParsers
- 利用C++语言编制一个LL（1）语法分析器，利用LL(1)控制程序根据显示栈栈顶内容、向前看符号以及LL（1）分析表，对输入符号串自上而下的分析过程。可通过消除左递归、提取左因子把非LL(1)文法改造成LL(1)文法。-Compiled using a C++ language LL (1) parser using LL (1) control program according to display the contents of the stack the stack, forward-l
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)
fanxvlie
- 用递归求数的反序列及递归求fib，devcpp环境下编写，在其他支持C语言的编译器上均可运行-Recursive sequence and find the number of anti-recursion fib, devcpp environment written in other languages supported C compiler can be run on
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