资源列表
fgds
- 自己的作业，关于银行家算法的描述，支持文件读入。-Own work, the descr iption on the banker' s algorithm, supporting documents read.
a7b01aa086f0
- 哲学家算法的C++实现，不是很强大， 很适合初学者。-Philosophers algorithm C++ implementation is not very strong, very suitable for beginners.
sha-1
- 把读入的数据按SHA-1算法要求，进行分组并完成最后一个分组的填充，在c环境下完成，需自行创建读入数据文档。-To read the data required by SHA-1 algorithm, grouping and complete fill the last group, completed under the c, to be read into the data files to create their own.
2GHz
- 2GHz的超高速数据采集系统设计与实现2GHz ultra-high speed data acquisition system design and implementation-2GHz ultra-high speed data acquisition system design and implementation
Flex99-12C
- MFCC特征参数提取 适应C++环境的程序源代码-mfcc c++
HMM
- hmm 隐马尔科夫模型训练在C++环境下程序代码-hmm HMM training environment in C++ code
counting-problem
- 给你两个数a和b,你的任务是计算出1在a和b之间出现的次数,比如说，如果a=1024,b=1032，那么a和b之间的数就是： 1024 1025 1026 1027 1028 1029 1030 1031 1032 则有10个1出现在这些数中。 -Give you two numbers a and b, your task is to calculate a and b in a number of times between, for example, if a = 1024,
Bresenham-line-algorithm
- 直线中点Bresenham 算法，输入起点坐标和终点坐标，即可画出直线-Mid-point of Bresenham line algorithm, the input point coordinates and end coordinates, then draw a straight line
closed_point
- 最近点对的算法： 对给定数量的点，求其中点对的最短距离。（测试样本为1000,5000个点，跑出来的时间均为0（s））详细思路请看程序注释。-The nearest point of the algorithm: for a given number of points, find the point where the shortest distance. (1000,5000 the test sample points, running out of time are 0 (s))
kkkmmmppp
- 用Ｃ语言实现KMP算法，即在长字符串找短字符串的所有出现。-KMP algorithm using C language, that is short in the long string to find all occurrences of the string.
zhengfujiou
- 判断数值的正负奇偶，并以对话框形式显示，基于labview-Determine the value of the positive and negative parity, and the dialog box is displayed, based on labview
shu
- 该算法有树的基本操作，对初学者有很多帮助，-The algorithm has the basic operation of the tree, there are a lot of help for beginners