搜索资源列表
queen-problem
- 八皇后问题,递归和分治算法的初步结合,可在VC6.0环境下调试,可修改其中注释部分以观察运行步骤-Eight queen problem, the recursive division algorithm and the initial integration of environment in the VC6.0 debugger to modify one part of the Notes in order to observe the operation of steps
StelaeBridgeRiver
- 这是递归算法的一个难度较大的例子。适用于学习算法的学生使用。-This is a recursive algorithm, a more difficult example. Learning algorithm applied to the students.
kalmanexpri
- The Kalman filter is a set of mathematical equations that provides an efficient computational [recursive] means to estimate the state of a process, in a way that minimizes the mean of the squared error. The filter is very powerful in several aspe
Kalman_filter
- 卡尔曼滤波算法实现代码.卡尔曼滤波是一种高效率的递归滤波器[自回归滤波器], 它能够从一系列的不完全及包含噪声的测量[英文:measurement]中，估计动态系统的状态。-Kalman filter algorithm implementation code. Kalman filter is an efficient recursive filter [autoregressive filter], it can from a series of incomplete and contain
diguixiajiang
- 这是我的编译课程设计，实现的是递归下降分析算法，你们可以下下来参考一下-This is my compiler curriculum design, implementation analysis of the decline are recursive algorithm, you can look down under
BinaryTreeData
- 用c语言实现了二叉树的数据定义，二叉树的构建、销毁，以及先序、中序、后序的递归算法及其源代码．-Implementation using c language definition of binary tree data, Binary Tree Construction, Destruction, and the first order, in sequence, after the sequence of the recursive algorithm and source code.
Fractal
- 用递归算法画出一个万花筒的小程序，挺有意思-Recursive algorithm used to draw a kaleidoscope of small procedures, quite interesting
eight_queen
- 八皇后问题，老归老，但试图用各种方法来实现求解，出乎意料的是，同样的算法，非递归实现的速度竟然比递归实现慢！-Eight queen problem, the old to the old, but trying to use various methods to achieve Solving Surprisingly, the same algorithm, the speed of non-recursive implementation was slower than the recur
BinaryTree
- 这是用C语言实现的二叉树的遍历算法，包括递归和非递归算法的实现。-This is to use C language implementation of the binary tree traversal algorithms, including recursive and non-recursive algorithm implementation.
abinarytree
- 求二叉树树高，和把由前序和中序构建树，又后序遍历这两步放在同一个递归中完成的两个程序。-Binary tree for tree height, and put by the former sequence and in order to build a tree traversal sequence after another on these two steps completed by the middle of the same two recursive procedures.
binaryTree
- 二叉树操作汇总，几乎设计所有算法，遍历递归、非递归、查找、求深度-Binary operation summary, almost all the design algorithm, recursive traversal non-recursive, search, and depth and so on
moving_average_v3.1
- Smooths a matrix (with/without NaN s) via recursive moving average method and eliminates data gaps. -MOVING_AVERAGE(X,F) smooths the vector data X with a boxcar window of size 2F+1, i.e., by means of averaging each element with the F elements at hi
CompanyEmployeesProject
- 程序通过LabVIEW完成了对公司员工基本信息创建添加、员工信息查询、删除以及员工信息修改的功能。通过对文本文件的操作完成以上功能，查找过程中采用递归算法对员工及其上级信息一并列出。-Procedures through LabVIEW employees completed the basic information to create added employee information query, delete and modify the functions of employee i
aaa
- 银行家算法C语言实现 采用递归方式进行实现银行家算法-Banker' s algorithm implementation using C language implementation recursive way of Banker' s Algorithm
MSearch
- 一个自己开发的工具软件,用于文件寻找,用递归方式实现,加入防错误处理-An instrument developed their own software for file search, using recursive way, by adding anti-error handling
traverse
- 后续遍历非递归 数据结构中二叉树的遍历中 使用后续遍历非递归遍历二叉树-Follow-up data structure traversal non-recursive traversal of binary tree used in the follow-up traversal non-recursive binary tree traversal
Huffman
- 本程序中定义了霍夫曼类实现霍夫曼编码和解码，其中编码过程用递归实现。-This procedure is defined category Hoffman Hoffman achieve encoding and decoding, encoding one of the process of using recursive implementation.
2_01
- cantor三分集的递归算法，按照三分集的生成规则表示在绘图空间中的生成关系-one-third cantor set recursive algorithm, in accordance with the two-thirds of the generation of rules set at the generation of mapping the relationship between space
2_11
- C曲线的递归算法。该算法是C曲线的生成过程，有很强的自相似性-C curve of recursive algorithm. The algorithm are C curve generation process, there is a strong self-similarity
2_13
- 分形树的递归算法。利用递归算法生成分叉树，实际上是生成元在每一个层次上不断重画的过程-Fractal tree recursive algorithm. The use of recursive algorithm to generate bifurcation tree, generators are in fact at every level on the process of continually re-draw