搜索资源列表
最小生成树prim算法
- 最小生成树的prim算法 是求图中的最短路径的一个重要算法 但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm
陈晓璐
- 24点牌游戏,我的第一个程序,还有很多bug没有修改,而且时间复杂度比较大.-24 sign game, my first procedure, but also has very many bug not to revise, moreover time complex quite is big
shiyan1
- 一元多项式.确定算法中每一语句的执行次数和整个程序的时间复杂度.-one yuan polynomial. Each algorithm to determine sentences and the number of the implementation of the entire process time complexity.
使用 JAVA 的设计概念简介
- 使用J#，JAVA来进行“掷骰子”这种小程序的实现，层层递进加深程序复杂度-using J # and Java to carry out "Dice" This small program to achieve the progressive deepening layers of complexity procedures
LZ77arithmetic
- 测试压缩一个425K的文件需要9.4秒，压缩后的文件为177K。如果要提高压缩速度，那么算法的复杂度就得增加了。 -compression testing of a 425K file 9.4 seconds, compressed the files to 177K. If we are to raise compression speed, then the algorithm complexity must increase.
几种排序方法的实现
- 用 插入排序, 希尔排序 ,冒泡, 快速排序 , 选择排序 ,堆排序, 归并排序 实现对任意随机数序列,并比较各种方法的运行快慢和复杂度-with insertion sort, Hill sequencing, bubbling Quick Sort, select, in order of ranking sculpture, merging order to achieve arbitrary random series, and compare the various methods o
新c++我们的呀
- 按时org,开放的网络天书! 基数排序是这样实现的: 假设需排序数列的取值...如果化成比较树可以知道,这样的排序算法复杂度的下限是O(N*lnN),而基数排序没有比较元素,所以所需排序时间就少了,我们... www.cnic.org/wiki/鍩烘暟鎺掑-time org, open network hieroglyphics! Sort base is achieved : a few assumptions need to sort out ... If the value into
B_M算法
- VC＋＋编程实现了二元域的BM算法。Berlekamp-Massey 算法是一个少有的高效算法。只需要输入密文中的2l个比特，就可以产生LFSR的最小多项式，从而生成整个序列。这里的l是系统的线性复杂度。-VC + + programming domain of the dual BM algorithm. Berlekamp-Massey algorithm is a rare efficient algorithm. Just type of dense text 2l bits, we c
Graph_BFS
- 这个是图的广度周游的源代码。解压即可。算法比较简洁，复杂度较小。-the breadth of the plan is to travel around the source code. Decompression can be. Algorithm comparison simple, less complex.
introtojaplabel
- 标准的JSP 标记可以调用JavaBeans组件或者执行客户的请求，这大大降低了JSP开发的复杂度和维护量。JSP技术也允许你自定义taglib，其实换句话说，taglib可以看成是对JSP标记的一种扩展，-JSP standard tag called JavaBeans components, or the implementation of customer requests, which greatly reduces the complexity of JSP development
Voice_activity_detection
- 采用能量门限的语音活动端点检测程序，计算复杂度低．-using energy threshold voice activities endpoint detection procedures, low computational complexity.
pujianfa
- 经典的功率谱减法，程序复杂度低，运算速度快-classic power spectral subtraction, the complexity of the procedure is low and fast.
pujianfa_based_on_statistic
- 基于统计模型的谱减法，程序复杂度不高，优于传统谱减法．-statistical model based on the spectral subtraction, the complexity of the procedure is not high and superior to the traditional spectral subtraction.
kalman_filter_method
- 卡尔曼滤波用于语音增强算法，复杂度较高，适合非平稳信号．-Kalman filter used for voice enhancement algorithms, complexity, suitable for non-stationary signals.
sortlinktabel
- 对链表进行排序，时间复杂度O（n2),类似于插入排序的思想-right sort, time complexity O (n2), similar to the sequencing of the insert thinking
hebingxulie
- 复杂度比冒泡法更低的排序算法，合并序列排序法-complexity law bubbling lower than the ranking algorithm, combined sequence Sort
qiangliantong
- 一个强联通算法的实现,时间复杂度很低,是很高效的算法-a strong Unicom algorithm implementation, time complexity low, is a very efficient algorithm
xiongyali
- 匈牙利算法,求解二分图最大匹配的一个时间复杂度与程序复杂度折中的算法-Hungary algorithm to solve the greatest two minutes map matching a time complexity and the complexity of program compromise Algorithm
shellsort111
- 附有本人超级详细解释（看不懂的面壁十天！） 一、 实际问题: 希尔排序(Shell Sort)是插入排序的一种。因D．L．Shell于1959年提出而得名。它又称“缩小增量分类法”，在时间效率上比插入、比较、冒泡等排序算法有了较大改进。能对无序序列按一定规律进行排序。 二、数学模型: 先取一个小于n的整数d1作为第一个增量，把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接插人排序；然后，取第二个增量d2<d1重复上述的分组和
SELECT2
- 通过精心挑选划分元素v，可以得到一个最坏情况时间复杂度为O(n)的选择算法。本次实习要求用c语言将此算法实现。要求实现此功能：输入一组数，返回A[i],使其为A(m:p)中第k小的元素，k是一个全局变量，取大于1的整数-division through carefully selected elements v, one can be the worst time complexity of O (n) algorithm. The internship requirement c langua