搜索资源列表
快速排序非递归算法(队列实现)
- 快速排序的非递归方法
Hanoi非递归
- Hanoi非递归源码-Hanoi non- recursive FOSS
后序遍历的非递归算法
- 二叉树后序遍历的非递归算法-binary tree traversal sequence of non- recursive algorithm
中序遍历的非递归算法
- 二叉树中序遍历的非递归算法-Binary preorder non- recursive algorithm
HANOI非递归算法(带动画演示)
- HANOI非递归算法(带动画演示)-HANOI non- recursive algorithm (with the animation demo)
7.先序遍历的非递归算法
- 先序遍历的非递归算法-preorder non- recursive algorithm
先序非递归遍历
- 用非递归的方法先序遍历二叉树-non- recursive method preorder Binary Tree
9.层次的非递归算法
- 层次的非递归算法-level of non- recursive algorithm
NQueen非递归
- 算法中的n后问题,用非递归实现的,用一般的c++编译器都可以实现-n algorithm after issue, the non- recursive with the general c compiler can achieve
语法分析之左递归实验
- 此为编译原理实验报告 学习消除文法左递规算法,了解消除文法左递规在语法分析中的作用 内含 设计算法 目的 源码 等等.... 算法:消除左递归算法为: (1)把文法G的所有非终结符按任一种顺序排列成P1,P2,…Pn 按此顺序执行 (2)FOR i:=1 TO n DO BEGIN FOR j:=1 DO 把形如Pi→Pjγ的规则改写成 Pi→δ1γ δ2γ … δkγ。其中Pj→δ1 δ2 … δk是关于Pj的所有规则; 消除关于Pi
非递归
- 数据结构 迷宫问题 迷宫非递归算法.rar-data structures, maze problem, non-recursive algorithm for maze problem
层次非递归遍历
- 数据结构中的常见算法,树的层次非递归遍历序算法,简单易懂-data structure of the common algorithm, the level of tree traversal sequence non- recursive algorithm, simple
二叉树jian
- 这个程序采用先序建立二叉树,并分别使用递归和非递归算法实现了对该二叉树的先中后序的遍历输出,并给出了一定的使用说明-this procedure was used in order to establish a binary tree respectively, and the use of recursive and non- recursive algorithm of this binary tree after the firs
非递归遍历一
- 本文用C语言实现了双链表结构树的前中后序非递归遍历-Using C language of the Double Chain structure tree before, during and after non- recursive traversal sequence
erchashu3
- 二叉树的便先中后三中递归和非递归方式的实现-binary tree after they were first three recursive and non- recursive approach to achieve
Hanoi_MFC_GDI
- 初学MFC时的拙作,一个汉诺塔的演示程序,采用非递归、非堆栈的算法,直接根据当前步数推算出汉诺塔的状态。界面用GDI实现,伪3D的风格。-beginners at the exposition, a HANOR the demo program, the use of non- recursive and non-stack algorithm, directly under the current steps are projecte
3Recusive_NoRec(1)
- 北大教授张抿讲授应用栈实现从递归到非递归的转换,机制十分灵巧-taught purse up from the application stack realization of the non- recursive recursive conversion, a very ingenious mechanism
hannuota
- 汉诺塔非递归程序,包含详细的解析、代码、结果及心得-Tower of Hanoi non-recursive procedures, contains a detailed analysis, code, results and experiences
maze
- 上学期自己写的一个迷宫程序,分别用递归和非递归算法实现-Last semester to write a maze procedure were recursive and non-recursive algorithm
datastructure
- 建立二叉树的链式存储结构,在此基础上完成下列算法: 1) 从键盘上输入二叉树的各个结点,建立二叉链表 2) 输出该二叉树; 3) 非递归的层次遍历序; 4) 非递归的先序遍历、中序遍历、后序遍历;-The establishment of the chain store binary tree structure, based on this algorithm to accomplish the following: