资源列表
BressenhamsLineDrawingAlgorithm
- Bressenhams Line Drawing Algorithm
CH7
- 哈希查找方法能在一段数据中以最快的方式找到想要的那个数，这种算法解决的关键就是哈系算法的建立函数。 -Hash method can search a section of data at the fastest way to find that the number of the algorithm to solve the critical line algorithm HA is set up function.
Sparse_Table_algorithm
- RMQ的sparse table算法的实现，对ACM竞赛队员非常有研究价值：）-RMQ the sparse table algorithm implementation, ACM contest for team members have research value is :)
windowedlinearphaseFIRdigital
- windowed linear-phase FIR digital
rebuild
- 根据先序和中序遍历的结果，重新构造二叉树-According to the results of the PreOrder and InOrder visit,rebuild the bitree
regressmodel
- 自己编的逐步回归分析的程序，用于分析确定最佳的显著影响因素的组合。-stepwise regression analysis procedure for determing the optimal combination of significant factors.
22
- 1．定义顺序栈的数据结构 2．编写函数实现的栈的初始化、入栈、出栈、判断栈是否为空的算法，并应用与表达式的括号匹配检测。 3．定义队列的链式数据结构 4．编写函数实现链队列的入队列、出队列算法-1. Stack data structure defined order 2. Write functions for the initialization of the stack, stack, stack, to determine whether the stack is empty
tree
- 该算法实现了树的另一种递归运算。摘自华科复试题。-The algorithm implements a recursive operation of another tree. From China Branch complex questions.
topK
- 计算topk 数组的最小的k个数,已经使用stl nth_element-calculat the topl
Dijkstra
- 本代码应用Dijkstra算法，实现了找最短路径问题，仿真了整个过程，是一个高效实用的代码值得下载实用。-This code apply Dijkstra algorithm to find the shortest path problem, the simulation of the whole process is a practical and efficient code is worth the download utility.
Hanoi
- 汉诺塔：汉诺塔（又称河内塔）问题是源于印度一个古老传说的益智玩具。大梵天创造世界的时候做了三根金刚石柱子，在一根柱子上从下往上按照大小顺序摞着64片黄金圆盘。大梵天命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定，在小圆盘上不能放大圆盘，在三根柱子之间一次只能移动一个圆盘。-Tower of Hanoi: The Tower of Hanoi (also known as Tower of Hanoi) is derived from an ancient Indian le
bezout234
- the bezout theorema in laguage c