资源列表
binary-tree
- 用C语言实现的二叉树的创建、添加节点、删除节点、递归和非递归遍历以及层次遍历-Using C language to create two fork tree, add node, delete node, recursive and non recursive traversal and hierarchical traversal
singlelist
- 单链表完备操作（创建，链表长度，节点插入，删除，定位，排序，逆序，打印等）-Single list complete operations (create, chain length, node insert, delete, positioning, sorting, in reverse order, printing, etc.)
btree
- 使用visual studio 2012在C++环境中实现B树的插入，删除等功能-Use visual studio 2012 to achieve B tree in C++ environment to insert, delete, etc.
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
TREE
- 在visual C++环境中实现图的最小生成树的生成，并实现最小生成树的权重的计算-Heavy computing implemented in visual C++ environment, minimum spanning tree graph generation and achieve the minimum spanning tree right
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
HuffmanTree2
- 在visual c++的环境中，通过二叉树实现对字符串进行HUFFMAN编码和译码的功能-In the visual c++ environment, by Binary Tree strings HUFFMAN encoding and decoding functions
main.cpp
- poj1486 代码 二分图匹配问题 寻找必须边 经典模型-poj1486 code bipartite graph matching side must find the classical model
gStack_2
- Stack在模板下的实现与各项功能操作实行。-Stack practiced in implementation and operation of the various functions under Templates.
SSTF
- 初学者编写 的SSTF算法的实现，不是不是太好，你可能会用得到。-the method of SSTF,maybe you need it.
Huffman_coding
- 用二叉树实现haffman编码,能够实现给定文件的编码。-using binary tree to achieve haffman——coding
shunxubiao
- 一、求表长度(验证型实验),二、插入元素操作(验证型实验),三、删除操作(验证型实验),四、 查找定位元素(验证型实验),五、 求表中的最大值元素，回main()函数前面，完善补充函数Tmax()，然后在这里调用完成（设计型实验）-First, find the table length (proof-test), two insert elements operating (proof-test), three delete operation (proof-test), four, look