资源列表
AVLtreeopertion
- 数据结构中对AVL树的一些操作,运行效率较高可以借鉴-data structure of the AVL tree operation, the higher operating efficiency can draw on
binarysearchtreeopertion
- 数据结构中对binarysearchtree的一些操作,执行效率较高-data structure right binarysearchtree some operations, the implementation of more efficient
splaytreeopertion
- 数据中对splaytree的一些操作,执行效率较高有借鉴意义-splaytree data on the operation more efficient implementation of referential significance
minimalspaningtree
- 生成最小生成树的源代码,对数据结构中图论处理有帮助,有兴趣可以下-minimum spanning tree generation of source code, the data structure graph theory to help deal with are interested can make
ab12
- 几篇关于谱减法的语音增强的文章，值得一看，希望有能力的同志们把代码编出来-few spectral subtraction of the speech enhancement of the article, an eye-catcher, with the hope of comrades who put out a code provision
MTSP
- 解决多商旅问题的一个源程序,对图论的处理比较有借借鉴意义-solve problems and countless more a source of graph theory can be used in handling more Significance
asswrthjsghd
- 交通灯交通 灯交通 灯交通灯灯交通 灯交通 灯-traffic lights at t raffic lights at traffic lights traffic lights at t raffic lights at t raffic lights at t raffic lights for traffic lights
1ekjd222
- 同步与异步write的效率比较 UNIX的文件I/O系统调用，及UNIX系统有关时 间函数的使用-Synchronous and Asynchronous write a more efficient document UNIX I / O system call. UNIX system and the use of the time function
dwqdsort111
- 1）实现以下常用的内部排序算法并对它们的时间效率进行比较： 必做（6种）：起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序； 选做：折半插入、二路归并、基数排序等等； 2）函数首部要求：void XXXXSort(char **list, int len, int n, int *c, int *s) 其中： a) XXXXSort为排序函数名，具体如下： 起泡排序BubbleSort 直接插入排序InsertSort 简单选择排序Sele
cobra-0.96.1
- 用java编写的html解码器，功能强大，使用方便-with java html prepared by the decoder, a powerful, easy to use
JXTAJavaP2P
- JXTA——Java P2P网络编程技术-JXTA -- Java programming technology P2P networks
Upgrade_Pack
- this the other info to the other codes-this the other info to the other codes