资源列表
linkedlist
- 简单的链表实现 linux c代码 数据结构-simple linkedlist
MMSE
- 基于MMSE准则的预编码仿真性能，分析了预编码的误码率取消走势-Precoding performance simulation based on MMSE criterion
shunxubiao
- 一、求表长度(验证型实验),二、插入元素操作(验证型实验),三、删除操作(验证型实验),四、 查找定位元素(验证型实验),五、 求表中的最大值元素，回main()函数前面，完善补充函数Tmax()，然后在这里调用完成（设计型实验）-First, find the table length (proof-test), two insert elements operating (proof-test), three delete operation (proof-test), four, look
Huffman_coding
- 用二叉树实现haffman编码,能够实现给定文件的编码。-using binary tree to achieve haffman——coding
SSTF
- 初学者编写 的SSTF算法的实现，不是不是太好，你可能会用得到。-the method of SSTF,maybe you need it.
gStack_2
- Stack在模板下的实现与各项功能操作实行。-Stack practiced in implementation and operation of the various functions under Templates.
main.cpp
- poj1486 代码 二分图匹配问题 寻找必须边 经典模型-poj1486 code bipartite graph matching side must find the classical model
HuffmanTree2
- 在visual c++的环境中，通过二叉树实现对字符串进行HUFFMAN编码和译码的功能-In the visual c++ environment, by Binary Tree strings HUFFMAN encoding and decoding functions
sort
- 在visual C++中分别实现插入排序，快速排序，希尔排序和堆排序，通过产生随机数验证排序正确性，并计算每个算法所需的交换次数和比较次数-In visual C++, respectively, to achieve insertion sort, quick sort, Hill sort and heap sort, verify the correctness sort by generating a random number, and each algorithm to calcul
TREE
- 在visual C++环境中实现图的最小生成树的生成，并实现最小生成树的权重的计算-Heavy computing implemented in visual C++ environment, minimum spanning tree graph generation and achieve the minimum spanning tree right
closestpair
- 在visual C++环境中，使用分治策咯实现最邻近点对的查找，并返回最邻近点对距离的平方-In visual C++ environment using divide and conquer tactics to achieve find the nearest point, and returns the nearest point on the square of the distance
btree
- 使用visual studio 2012在C++环境中实现B树的插入，删除等功能-Use visual studio 2012 to achieve B tree in C++ environment to insert, delete, etc.