搜索资源列表
XMLparserforc
- 将树形数据结构用于最小化DOM 模型XML 编解码器的开发。在解析XML 文本时，基于Expat 解释器将XML 字符串构造成树 状结构；编码时构造DOM 树结构，采用非递归深度优先法遍历树，将其串行化成XML 串。本编解码器解决了国际化语言关键问题，是 一个通用、高效的工业级XML 应用支撑模块。-This paper designs a DOM liked tree data structure for developing a minimal DOM based eXtended
__xmlParser
- XML解析类，轻巧、简单、易用(内含源码、示例程序以及文档说明)-This is a basic XML parser written in ANSI C++ for portability. It works by using recursion and a node tree for breaking down the elements of an XML document.
Fractal
- 分形算法设计，包括摇曳的分形递归树、摇摆的Sierpinski三角形、万花筒和王冠（Julia集）-Fractal algorithm design, including the fractal recursion trees swaying, rocking the Sierpinski triangle, Kaleidoscope and the crown (Julia set)
musicdsp
- musicdsp source code archive-Analysis Beat Detector Class Coefficients for Daubechies wavelets 1-38 DFT Envelope detector Envelope Detector class (C++) Envelope follower with different attack and release Fast in-place Walsh-Hadamard Tra
Practice2
- 用普通递归与消除尾递归的方法实现解决汉诺塔问题c#-With general recursion and tail recursion elimination method to solve Tower of Hanoi problem c# implementation
Fractral4
- 初步介绍分形编程，示例中显示了4种分形图案，递归算法简单易懂。-Introduction to fractal programming, the example shows four kinds of fractal patterns, recursion is easy to understand.
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.
MARYUWA
- c语言编写的DSP程序，用Yule-Walker方程，采用levinson递推实现功率谱估计。-c language of the DSP program, with the Yule-Walker equations, levinson recursion to achieve power spectrum estimation.
Ackerman
- 界面实现递归算法和非递归算法计算Aerman函数-Interface to achieve recursion algorithm and non-recursive algorithm Aerman function
nqueens-recursion-backtracking-n^n
- n皇后问题的递归回溯实现， 状态数：n^n-n queens problem of recursive backtracking implementation, the number of states: n ^ n
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!
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
- 光线跟踪程序,即由光源发出的光到达景物表面后，产生反射和折射。光就改变方向，沿着反射方向和折射方向继续前进，直到遇到新的景物。光经场景景物间的多次反射、折射后投射到离视点最近的景物表面，最终进入人眼。由于实际光线跟踪算法的跟踪方向与光传播的方向是相反的，所以我们可以由视点向屏幕象素发出一根射线，与第一个景物相交后，在其反射与折射方向上分别进行跟踪，继续与第二个景物相交……重复上述过程，直到被跟踪的光线射出画面或跟踪深度达到某个设定的最大递归深度时，停止跟踪。-Ray tracing progra
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 to some conjurer s trick ra
FileFind
- 我初学多线程编程，查找文件用的递归方法。不怎么支持深递归-I am beginner multi-threaded programming, recursive method used to find files. Not very deep recursion support