搜索资源列表
piaoliang
- 在二叉搜索树上删除一个有两个子女的结点时，可以采用以下三种方法： (1) 用左子树TL上具有最大关键码的结点X顶替，再递归地删除X。 (2) 交替地用左子树TL上具有最大关键码的结点和右子树TR上具有最小关键码的结点顶替，再递归地删除适当的结点。 (3) 用左子树TL上具有最大关键码的结点或者用右子树TR上具有最小关键码的结点顶替，再递归地删除适当的结点。可随机选择其中一个方案。 -two forks in search of a tree to delete two chi
sequential_recursion_search
- c code for sequencial recursion search -c code for sequencial recursion search
消除左递归1
- 对给定的文法消除左递归。- To the grammar which assigns eliminates the left recursion.
消除左递归得到后缀式
- 解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, after but the grammar tree carrie
BST - Bina2889710132001
- Binary Search Tree - with additional recursion functions (smallest, parent & successor) etc
scantree
- This a small program which scans a particular section of your hard disk ( a tree) using recursion and returns information like the total number of files, folders, used disk space in that tree.
hanno
- 这是一个汉诺塔游戏的原代码,tc环境.可是图型界面的哦~~,不要认为是一般的递归了!-HANOR the original game code, tc environment. However, the map-based interface ~ ~ Oh, do not believe that the general recursion!
贴片法画球（OpenGL)
- 不是用递归，改用贴片法。也是很基本的离散方法-not use recursion using the patch method. Only basic discrete methods
N_queue
- 根据回朔法思想来求解Ｎ皇后问题，用递归来实现回朔．-Thought to solve N Queen's problems, and use recursion to achieve back Schomburg.
新建 RTF 文档 (3)
- 这是一个典型的非数值问题，如果使用非递归算法求解此问题，要设计复杂的算法，编写很长的程序。而使用递归算法可以使整个算法清晰，使程序简洁。本问题分析并建立递归算法的过程是典型的抽取问题本质、建立递归算法 并最终解决非数值问题递归实例。-This is a typical non_numerical value problem.you must design complicated arithmetic and long program if you use non_recursion arithm
Recursion.rar
- 快速DCT变换 迭代算法, Fast DCT transformation iteration algorithm
ShowTree.rar
- 递归显示树形视图所有节点 对树形视图实行动态添加删除 VC MFC CTreeView,Recursion tree view displays all nodes on the tree view of the kind of dynamic add remove VC MFC CTreeView
24点游戏，利用递归法
- 24点游戏，利用递归法，在vc DOS环境下运行结果，可实现多张牌多点数功能-24-point game, the use of recursion in vc DOS environment, the results can be multi-functional cards and more points
chap2_11_RML
- 递归极大似然数估计，在实际通信系统仿真过程中非常有用-Recursion number of maximum likelihood estimate, in actual communication system simulation process is very useful
nijuzheng 求矩阵的逆矩阵
- 求矩阵的逆矩阵，不用递归，就可输出任何输入矩阵的逆矩阵。用C++写的。算法思路绝对清晰易懂。-Find inverse of a matrix, without recursion, can you export any of the input matrix matrix. Written in C++. Algorithm ideas absolutely lucid.
dashuxiangcheng
- 利用分治方法设计实现大整数乘法的递归算法-Using the method of big integer partition design and realize the recursion algorithm square
KochSnow
- 利用OpenGL分形生成科赫雪花，可改变递归深度以及拖动-Using OpenGL Koch snowflake fractal generation can change the recursion depth and drag
hannoi
- 汉诺塔问题c语言实现 递归方法-Tower of Hanoi Tower of Hanoi problem c language c language recursion problem
HeapPermute
- 一个很快的全排列的算法，使用了递归，附上证明-A fast algorithm for the entire array, use the recursion, attach proof
homework1
- 组合问题递归求解。求n个数取r个数的所有组合结果-Recursion to solve combinatorial problems. N r number of requirements to take the number of results for all combinations