搜索资源列表
经典汉诺塔问题c语言版
- 汉诺塔是初学数据结构的同学最头疼的问题，这里是一个用递归函数解决汉诺塔问题的经典c语言程序，里面有代码和执行文件。-HANOR data structure is that when the students most headaches, here is a solution using a recursive function HANOR a classic c language program, which has code and the implementation document.
migong-c
- 迷宫算法！通过递归算法实现！找到最优路径，完成迷宫出口的查找！-maze algorithm! Through recursive algorithm! To find the optimal path to complete the maze exports to search!
算式分析器
- 使用递归的方法实现的算式分析器，给定一个符合C语言格式的算式，可以使用括号，单目运算符等，计算算式的运算结果。-use recursive method formula Analyzer, to set a C-language format with the formula, you can use brackets, Monocular Operators, calculation formula of the calculation results.
树跟二叉树
- 本程序是实现二叉树跟树的常用算法，都是尽量用非递归来编写的。关于二叉树的都可以从键盘动态输入，关于树的就不可以，原因是树的结构问题，在程序中，树的建立用到动态左孩子/右孩子建立-this program is a binary tree with the tree is commonly used algorithm, as possible, to use non - recursive prepared. On the binary tree can be dynamic input fro
HORSEJUMPCHESS
- 马跳棋盘递归算法(TC实现,并提供示意图),可移植到任何C编译器-Ma checkerboard recursive algorithm (TC achieved, and to provide diagram), and can be transplanted to any C compiler
（－1结束）求树高
- 用递归的方法的方法求二叉树的树高，注意输入的节点数据以－1结束。-use recursive methods for the binary tree height, pay attention to input data to the nodes -1 end.
重发求树高的程序
- 用递归的方法求二叉树的树高，使用时更加灵活，注意输入的数据以－1结束-using recursive method for binary tree height, use a more flexible, pay attention to input data to the end-1
实验7 二叉树 北京师范大学数学科学院
- 自创的算法，输入表达式，建立二叉树的程序，然后输出前缀中缀后缀表示法，利用的对表达式的分割与递归实现输入，同时这也是一个完整的波兰式转换程序，相当稳健-own algorithm, the importation of expression, the establishment of the binary tree and then output the suffix prefix which is made up of the method, using the right expressio
myproject
- 应用DFS，递归调用完成的图中环查找算法过程-Application of DFS, recursive calls to complete the plan process in Central search algorithm
MY_DFS
- DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. Then the search backtracks, retur
Quicksort
- 快速排序（Quicksort）是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。-Quick sort (Quicksort) is a bubble sort of an improvement. By the CAR Hoare in 1962. The b
recursive-algorithm
- 用算法分析中递归与分治算法实现的，最长公共子序列算法，编程环境为vc-Analysis using the recursive algorithm and the divide and conquer algorithm, the programming environment for the vc++
recursive
- 数据结构作业 c++写的recursive的运用，编译可过，功能较为全面，有兴趣者可-Data structure operations recursive c++ to write the application, the compiler may have functions more comprehensive, those interested can take a look
Tree-Non-recursive-traversal
- 二叉树的中序与先序的非递归遍历算法的实现 用VS2010编写的-Binary tree in order and first order non-recursive traversal algorithm implementations written using VS2010
Recursive-reverse-the-output-string
- 递归反向输出字符串，非常基本的程序，值得刚开始接触C语言的人学习。-Recursive reverse the output string, and a very basic program, it is worth just getting started with the C language learning.
recursive
- 关于数据结构算法里递归的程序代码，对于list sequence的递归计算。-This project will give you experience writing recursive functions that operate on recursively‐defined data structures and mathematical abstractions.
Recursive
- 数据结构中各种递归利用的小例子，方便我们理解递归。-Data structure of recursive use small example, convenient we understand recursion.
recursive
- 关于list和binary tree的迭代函数实现-Implementation of List_t and binary tree using recursive functions.
non-recursive-of-binary-tree
- 二叉树的非递归遍历，运用栈的思想实现二叉树非递归遍历-Non-recursive binary tree traversal, using stacks of thinking non-recursive binary tree traversal
Recursive-implementation-ZK-tree
- ZK树的递归实现，不断开辟栈空间保存函数的局部变量，当执行到递归出口时，函数逐层向上返回，一直到最初的调用处。-Recursive implementation of the ZK tree, and constantly open up the stack space to preserve the local variables of the function, when the implementation of recursive exit, the function layer by