搜索资源列表
bianli
- 数据结构中树的遍历，包括递归和非递归遍历 结构很完整-data structure traversal of the tree, including recursive and non - recursive structure is complete traversal
shixianshurushuchu
- 用递归的方法编写函数求Fibonacci级数的源程序-using recursive function method for the preparation of the source Fibonacci Series
qiege
- 解决了矩形板切割矩形材料的问题，采用递归分治的方法-solve the rectangular plate rectangular cutting materials, using recursive method of administration
scc
- 递归算法求一个有向图的强连通分量，输入格式如压缩包中data4.txt，第一行为顶点个数。输出到result.txt中。-recursive algorithm for a directed graph strongly connected component, the input format such as compression package data4.txt. the first acts of the number of vertices. Result.txt exported
shu
- 1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个
shu2
- 2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点
左递归文法分析源代码
- 输入已经消除左递归的以及提取公共左因子的LL(1)文法，再输入相应的表达式，若分析成功，则在递归输出过程中输出\"acc\",若不成功，则有相应的报错以及位置指名。注意，要把同一个非终结符的产生式分成单个输入。他会自动计算first,follow,预测分析表的构造，但并不输出。-importation has been eliminated and left recursive public from the left-LL (1) grammar, further impo
erchashu
- 建立二叉树，统计二叉树中度为2的结点个数和叶子结点个数（ 用递归或非递归的方法都可以，先序、中序或后序均可）-establish binary tree, Statistics for the two binary tree to moderate the number of nodes and the number of nodes leaves (with the recursive and non - recursive method can be first order, After t
dgxj
- 用C++实现编译原理的递归下降语法分析 用C++实现编译原理的递归下降语法分析-C compiler to achieve the principle of recursive grammar analysis dropped C compiler to achieve the principle of recursive grammar analysis drop
SJ20
- 求树的中序遍历,运用的方法是用非递归的算法来做的.-for tree traversal sequence were used method is the use of non - recursive algorithm very consistent.
endotesting
- endotesting used to recursive test a important tech tool for QA
adaptive_anisotropic_2D_gaussian_filter
- Gaussian filtering in one, two or three dimensions is among the most commonly needed tasks in signal and image processing. Finite impulse response filters in the time domain with Gaussian masks are easy to implement in either floating or fixe
PrtInt16
- 十进制打印AX寄存器中的值的函数 对64位数的高32位进行递归排序-metric Print AX register with the value of the function of the median 64-32 ranking for recursive
快速排序演示
- 快速排序的递归解演示，用20个字符串代表20个数，显示每次分组结果，延时10000。如果在你的机子上太快，可以加长延时。-rapid sequencing of recursive solution demonstrations, with 20 representatives of 20 string number, the results show that each packet, Delay 10000. If your machine on too fast, it could be
递归的应用：最简单分形图形实现ksqx
- 递归的应用：最简单分形图形实现ksqx-recursive applications : the most simple Fractal Graphics ksqx
RecursiveFibonacci
- 利用递归计算Fibonacci数列-recursive computation using Fibonacci Sequence
8Huanghou
- 八皇后问题的C语言递归示例.详见ReadMe-the C language recursive example. See ReadMe
bhh
- 八皇后问题的递归求解-eight of the Queen's recursive solution
三柱汉诺塔
- 经典算法，递归的典型，汉诺塔的程序，vb版的。。。。。接着还有java版本的-classic algorithms, the typical recursive, HANOR procedures, vb version. . . . . Then there java version of the.
四柱汉诺塔
- 向来汉诺塔说的都是三个柱子的。。。。 那么四个柱子的呢？ 从三柱到四柱。。。。。熟练掌握递归-has said are the three pillars. . . . Then the four pillars? From the three - to four-post. . . . . Skilled master recursive.