搜索资源列表
nqueens-recursion-backtracking-n^n
- n皇后问题的递归回溯实现， 状态数：n^n-n queens problem of recursive backtracking implementation, the number of states: n ^ n
totalarrange-recursion-backtracking
- 在排列树上递归回溯搜索全排列问题的全部解-Recursive backtracking search tree in the arrangement of the whole array of all solutions of the problem
compiling
- 编译原理实验：词法分析、语法分析、语义分析，包含代码和报告、构建分析表、消除左递归、语法分析、流程图-Compiler Principle Experiment: lexical analysis, syntax analysis, semantic analysis, including code and reports, construction of the table, to eliminate left-recursion,
Fullarray
- 3种求解全排列的方法，递归，迭代等，VC++6.0编译通过。-Three kinds of methods of solving the full array, recursion, iteration, etc., VC++6.0 compile.
recursion
- Chapter two of Data Abstraction and Problem SOlving with C++ by Frank M Carrano
happy
- 编译原理词法分析器的功能是利用函数之间的递归调用模拟语法树自上而下的构造过程。 改造文法：消除二义性、消除左递归、提取左因子，判断是否为LL（1）文法 -Compiler theory lexical analyzer function is to use recursive function calls between the simulation process of constructing the syntax tree
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
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 goo
RecursionEnumerator
- 递归式枚举，通过递归，广度深度进行枚举。-Recursive enumeration, by recursion, breadth of depth of enumeration.
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
RayTrace
- 光线跟踪程序,即由光源发出的光到达景物表面后，产生反射和折射。光就改变方向，沿着反射方向和折射方向继续前进，直到遇到新的景物。光经场景景物间的多次反射、折射后投射到离视点最近的景物表面，最终进入人眼。由于实际光线跟踪算法的跟踪方向与光传播的方向是相反的，所以我们可以由视点向屏幕象素发出一根射线，与第一个景物相交后，在其反射与折射方向上分别进行跟踪，继续与第二个景物相交……重复上述过程，直到被跟踪的光线射出画面或跟踪深度达到某个设定的最大
homework1
- 组合问题递归求解。求n个数取r个数的所有组合结果-Recursion to solve combinatorial problems. N r number of requirements to take the number of results for all combinations
recursively
- In my experience. teaching students to use recursion has always been a difficult task. When it is first presented, students often react with a certain suspicion to the entire idea. as if they had just been exposed
FileFind
- 我初学多线程编程，查找文件用的递归方法。不怎么支持深递归-I am beginner multi-threaded programming, recursive method used to find files. Not very deep recursion support
DataStructuresAndAlgorithms(JAVA)
- 此书从介绍JAVA基础到数据结构与算法基础,并结合JAVA给予实例演习,从线性表,链式表,栈与队列,递归,讲到树,图,并以JAVA实例演习各种查找,排序算法.实为一本难得的好书,现与大家共同分享.-From the introduction to the book based on JAVA based data structures and algorithms, and give examples with JAVA exercis
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 )