搜索资源列表
diguixiajiangfenxi
- 这是一个用C语言实现的递归下降语法分析的程序-This is a C language syntax down the recursive analysis procedures
BiTNode
- BiTNode二叉树的递归和非递归遍历(包括中序\\先序\\后序)-BiTNode binary tree recursive and non - recursive traversal (including the sequence \\ first sequence \\ after Prologue)
TurboTree
- 很多人都使用“父—子结构＋递归算法”来显示树型的层次结构，这里给介绍一种简单方便的数据结构和算法，快速显示树型的层次结构-many people use a "parent-child structure + recursive algorithm" to show the level of tree structure, here introduced to a simple data structure and algorithm, shows the hierarchi
19854794biaodashisiyuanshi
- // 语法制导翻译器设计示范程序 // ----- 算数表达式四元式翻译(递归子程序法) // 要求：1. 读懂该程序，并上机调试成功； // 2. 运行该程序，输入源表达式（字母：表示变量，数字：表示常数。） // 3. 反复运行，考查输出的各种四元式的正确性。 // 4. 实验报告内容：表达式的属性翻译文法；递归子程序框图； // 运行结果的记录（输出的三元式不得少于10条！） -/ / syntax translation guided desi
cbi
- 计算组合数公式C(ele,sel)=A(ele,sel)/sel! 不用递归实现，放心使用-calculation formula portfolio C (ele, sel) = A (ele, sel) / sel! Recursive not achieved, the use of confidence
afsfr
- In 1 960 , R . E . Kalman published his famous paper describing a recursive solution to the discrete data linear filtering problem [ Kalman6O ] . Since that time , due in large part to advances in computing , the Kaloanfilter has been the subject
btree1
- 假设二叉树采用链表方式存储,编写一个二叉树先序遍历的非递归算法-assumptions binary tree using Listless way to store, prepare a binary tree preorder non - recursive algorithm
6.44
- 哈夫曼树，二叉树列表，的多元递归算法gfdgfdgd-Huffman tree, binary tree list, the multi - recursive algorithm gfdgfdgd
2.21
- 哈夫曼的优先算法（根据递归调用的循环算法）很有用-Huffman algorithm (based on recursive algorithm called the cycle) useful
15577661
- 递归求字符串长度 许多公司的面试题目，找工作的人可以-recursive string length for the many interview subjects, people looking for work can s
Tree+Postorder
- 层次输入建立二叉树并后序遍历,三叉链式存储,递归遍历-import levels and the establishment of a binary tree after preorder, trigeminal chain store, recursive traversal
shizhifenxi
- 数值分析算法描述与习题解答，由清华大学徐士良教书，用C编写的各种数学算法。比如：托伯利兹型线性代数方程组的递推算法，全选主元高斯消去法解复系数线形代数方程组，复矩阵求逆的全选主元高斯-约当法，等；-numerical analysis algorithm descr iption and answer the questions from Qinghua University XU Shi-liang, teaching C prepared by the various mathematica
Hanoi塔java源程序
- Hanoi塔java源程序 一个经典的递归程序，在java上的实现。-Hanoi tower java source a classic recursive procedure, in the realization of java.
0-1programming
- 0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0, 1, 0, 0)，最优值是f(x*)=4，是不是书中写错
foocalc
- 一个基于递归下降的四则运算计算器-based on a recursive decline in four Operational Calculator
1229_bfs
- n个石头(每相邻两个的距离是1米,最边上石头和岸的距离也是1米),礼物放在第m个石头上,青蛙第i次跳2*i-1米.问能否得到礼物.(n>=49肯定能得到礼物,n<49,可以bfs或递归)-n stones (each of the two adjacent distance of a meter, the most edge of the rocks and the shore is a distance meters), gifts m on the first stone, th
1457_other
- 把1到n的数放在一个环里,使相邻的2个数和是质数.用递归做-n to put a few on a loop, so that the two neighboring and the number is prime. Using recursive do
fanta
- 梵塔问题的递归求解-Vatican Tower of recursive solution
MazeProblem
- 迷宫问题输出每一步的棋盘变化 第一个用递归解决的问题-maze problems every step of the output change a chessboard with the recursive solution
迷宫探路IV(递归算法)
- 迷宫探路IV(递归算法) -maze Pathfinder IV (recursive algorithm)