资源列表
BiTreeHeight
- 用递归方法求二叉树高。构建二叉树，并采用递归的方法求其高度(A recursive method for finding the height of two forked trees)
Fibonacci
- 基于队列设计算法，输出任意位置的Fibonacci 数列元素值。 fib(0) = 1 fib(1) = 1 fib(n) = fib(n-1)+fib(n-2)(Based on the queue design algorithm, the Fibonacci sequence element value of any location is output.)
shunxubiaonizhi
- 对顺序表元素就地逆置，将线性表（a1,a2,……,an）逆置为（an,an-1,……,a1）。(The sequential table element is placed in place, and the linear table (A1, A2,... An) inversed (an, an-1,... A1).)
中缀
- 利用栈设计算法，实现中缀表达式的求值，只考虑整除。(Stack design algorithm based on the realization of infix expression, infix expressions only consider divisibility.)
Snake_project
- 用C语言写的贪吃蛇小游戏，游戏他通过蛇身不断吃掉游戏里随机出现的食物，望采纳(Using C language to write the snake game, the game through his continuous random food eating snake game, hope to adopt)
c语言入门代码
- c语言入门的相关代码 包含了循环，数组，指针，文件，结构等基本知识(Relevant code for the introduction of C language It contains basic knowledge of loops, arrays, pointers, files, structures, and so on)
矩阵调度算法
- 迪杰斯特拉算法，求两点最短路径，可以简单快速得出矩阵内两点之间的最短路径。(Di Jie Si Te La Suan Fa)
source
- [数据结构（Java版）（第4版）][叶核亚][程序源代码](data structure(Java))
Beginning Algorithms
- 对编程涉及的算法进行了深度剖析，是不可多得的资料(A deep analysis of the algorithms involved in programming is an invaluable data)
2
- 输出八皇后问题所有情况，并且记录下共有多少种情况(All cases of the output of eight queens)
１
- 找到二叉排序树T中小于x的最大元素和大于x的最小元素(Find the maximum element less than x in the two fork sort tree T and the smallest element larger than the X)
２
- .假设含n个记录的序列中，其所有关键字为值介于v和w之间的整数，且其中很多关键字的值是相同的。则可按如下方法进行排序：另设数组number[v…w]且令number[i]统计关键字取整数i的记录数，之后按number重排序列以达到有序。试编写算法实现上述排序方法?(Suppose that in a sequence containing n records, all the keywords are integers between V and W, and many of them are