搜索资源列表
intpart
- 采用非递归方法实现的整数分拆程序，即把一个正整数表示成所有可能的整数相加的形式。逆序打印结果。-Ways to use non-recursive implementation of an integer spin-off process, that is, to express a positive integer integer into the sum of all possible forms. Reverse print the results.
TreeTraversal
- 已知二叉树的先序、中序遍历的结果，构造出该二叉树，并用非递归的后序遍历算法遍历该二叉树-Sequence of the first known binary tree, traversal of the results of the binary tree structure, and after the use of non-recursive traversal of the binary tree traversal algorithm
stackfibnaqi
- 斐波那契数列计算的非递归算法 用栈来模拟递归的经典题目-Fibonacci calculation of non-recursive algorithm used to simulate the recursion stack classic topic
path
- 找出（二叉树中）从根结点到任一给定的结点的路径（非递归实现）-To find (in Binary Tree) from the root node to any given node of the path (non-recursive implementation)
mataqipan
- 数据结构课程设计之马踏棋盘（非递归实现）-Data structure of the horse riding course design board (the realization of non-recursive)
a
- 按照前序非递归遍历二叉树，递归法将二叉树的左右子树互换-In accordance with the pre-order traversal non-recursive binary tree, binary tree recursive method will swap the left and right subtree
qpl
- n个数的全排列的非递归算法，cpp文件可编译运行-n the number of full-order non-recursive algorithm, cpp files can be compiled to run
Robert_Sedgewick
- Robert Sedgewick非递归全排列算法-Robert Sedgewick wide array of non-recursive algorithm
polyfill
- 边界填充算法,将边界填充的递归算法转化成非递归-scan line seed fill
12
- 实现八皇后（一种小游戏）的算法，非递归可以得到所有正确结果。-The achievement of the eight Queen' s (a game) of the algorithm, non-recursive results can be all right.
Tree
- 非递归先序，中序及后序遍历二叉树. 根据二叉树广义表的字符串创建二叉树-First non-recursive sequence, and after the sequence of binary tree traversal
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
Queen
- 解决八皇后问题的算法，能够用非递归的方法解决八皇后问题-8 Queen' s problem solution algorithm
Hanoi
- 汉诺塔问题的非递归解决，能够用非递归的方法解决汉诺塔问题-Tower of Hanoi non recursive solution can be non-recursive solution to the Tower of Hanoi problem
bianli
- 建立二叉树用非递归方法对树进行遍历，其中用到了栈来保存中间数据。-The establishment of tree with non-recursive method to traverse the tree, which uses a stack to save the intermediate data.
shuju7
- 灵活运用非递归的遍历算法实现二叉树的其它各种运算；掌握按层次顺序遍历二叉树的方法；熟练掌握在中序线索二叉树上找给定结点的指定顺序下的前驱和后继的方法。-Flexibility in the use of non-recursive binary tree traversal algorithm to achieve a variety of other operations master-level order according to the method of binary tree tr
fenxi
- 编译原理，非递归预测分析，分析一个句子是否是一个文法的句子-Compiler Construction Principles, non-recursive predictive analysis, analysis of whether a sentence is a grammatical sentence
erchashu
- 实现二叉树的前序非递归遍历和比较两棵二叉树是否相似的算法。-The realization of the first order binary tree non-recursive binary tree traversal and comparison of two algorithms are similar.
tree
- 数据结构习题之一，建立二叉树、先序非递归遍历、中序递归遍历、后序递归遍历，求叶节点数-Exercise one of the data structure, the establishment of binary tree, the first order traversal non-recursive, recursive in order traversal, postorder recursive traversal, and leaf nodes
hanoiWNR
- 非递归实现汉诺塔，基于c++，实现了非递归汉诺塔。-Tower of Hanoi non recursive realization, based on the c++