搜索资源列表
algorithms
- 关于很多实用算法的描述,例如递归、贪心算法-About the descr iption of a lot of practical algorithms, such as recursive, greedy algorithm and so on
LoopN
- 使用递归实现N重循环,这里的N是不确定的。此代码实现的功能描述如下: 1. 有一个字符串的矩阵,用vector< vector< CStirng > > 表示 2. 行与行之间进行排列组合 3. 输出所有组合的字符串-Recursive use of re-implementation cycle of N, where N is uncertain. This code describes the implementation of the function
RecursiveFractalAnimationtreeimplementation
- 该代码采用递归算法编程实现下列分形树,并且提供界面允许用户输入分形树迭代次数,有程序绘制树形分形体并动画显示分形树生长过程 代码内含文档说明 -Recursive algorithm using the programming code to achieve the following fractal tree, and provides the interface allows the user to enter iteration fractal tree, the procedur
ding
- 递归分析器,完成递归分析器的各个功能,很好用-Recursive parser, analyzer finish all recursive functions, a very good use
fast
- 首先我们选择一个中间值middle程序中我们使用数组中间值,然后 把比它小的放在左边,大的放在右边(具体的实现是从两边找,找到一对后交换)。然后对两边分别使 用这个过程(最容易的方法——递归)。 -First of all, we choose a middle value between the use of an array of programs between our values, then it is smaller than put on the left, large on th
strext
- 字符串扩展问题的递归算法及动态规划算法的详细分析及实现-implementation and detailed analysis of recursive algorithm and dynamic programming algorithm of string expansion issue
TreeViewXML
- 用XML和TreeView实现无限分类的递归调用,主要是用在管理系统下面的。利用frame框架做的一个小示例-Using XML and TreeView classification unlimited recursive calls, is mainly used in the management of the system below. Framework for the use of frame to do a small sample
Compiler
- 编译课上做的小程序,用四种分析方法分别实现(LL1,算符优先,递归下降,简单词法分析) 完成对正则文法所描述的Pascal语言子集单词符号的词法分析程序。 <标识符>→字母︱ <标识符>字母︱ <标识符>数字 <无符号整数>→数字︱ <无符号整数>数字 <单字符分界符> →+ ︱- ︱* ︱ ︱(︱) <双字符分界符>→<大于>=︱<小于>=︱<小于&g
8Queen
- 此程序乃8皇后问题,是数据结构中一个典型递归调用程序,此程序可输入任意个皇后数目赖进行计算-This procedure is 8 Queen' s problem is the data structure of a typical recursive procedure call, this program can enter any number of Queen' s calculation depends on
Nquenes
- N皇后问题的递归实现,仅仅只用于C++,JAVA无法执行-N Queen' s problem of the realization of the recursive, just only for C++, JAVA can not perform
eightQueen
- 简单的八皇后问题。分别用一般的递推法和二叉树前序遍历写成,非常适合初学者阅读。-8 Queen' s problem simple. Were general and recursive binary tree traversal pre-written, very suitable for beginners to read.
Subset
- 这是一个关于用递推法解决求某一个集合的所有的子集。非常适合初学数据结构的同胞阅读。-It is a recursive method used to solve a set for a subset of all. Data structure is very suitable for beginners to read compatriots.
btree
- 实现二叉树的后序的递归和非递归算法。 包括构造函数和析构函数。-After the realization of the sequence of binary tree recursive and non-recursive algorithm. Including the constructor and destructor.
AIC
- AIC法定阶的依阶次递推算法程序,计算残差方差的估计值的结果计算AIC:-AIC in accordance with the statutory order of procedure order recursive algorithm for calculating the estimated value of residual variance of the results of calculating the AIC:
ORDER
- 按阶次递推用F检验法判断模型阶次的算法 用模型计算出仿真数据,再按模型阶次递推算法的辨识方法,辨识模型的阶次和参数 -By order recursive F-test used to determine model order of the algorithm with the simulation data model, and then the recursive algorithm for model order identification method, identifica
MSLS
- MSLSⅠ多步递推最小二乘法 Msls分三步对系统和噪声模型进行辨识,采用脉冲序列作为辅助系统模型,用计算输出数据;用原输出数据计算,用递推最小二乘方法分别对系统参数和模型参数进行估计。 -MSLS Ⅰ recursive least squares multi-step Msls three steps on the system and noise model identification, the use of pulse sequence as a supplementary s
prime
- 素数环: 把从1到10这10个数摆成一个环,要求相邻的两个数的和是一个素数。 〖问题分析〗 这是一道回溯的题目。从1开始,每个空位有9种可能,每种可能加入约束条件即可 1.与前面所有的数不重复 2.与前一个数和为素数(最后一个和第一个也要满足)。 〖算法流程〗 1、数据初始化; 2、递归填数: 判断第J种可能是否合法; A、如果合法:填数;判断是否到达目标(10个已填完): 是,打印结果;不是,递归填下一个; B、如果不合法:选择下一种可能;-Prime Centra
hannoi
- 本程序通过用递归调用的方法实现了汉诺塔问题,这是一个通用的程序,通过输入的层数结果输入到一个out.txt的文件中-This procedure by using the method of recursive calls a Tower of Hanoi problem, which is a common procedure, the results by entering into the layers of a document out.txt
mataqipan
- 数据结构课程设计之马踏棋盘(非递归实现)-Data structure of the horse riding course design board (the realization of non-recursive)
Binarytreerecursiveltraversing
- 二叉树递归遍历 这是我们学校课程设计的一部分。能运行。-Recursive Binary Tree Traversal This is part of the design of the school curriculum. Will be able to run.