资源列表
gongjiaosuanfa
- C++经典算法之 公交算法 常用算法 方便使用-C++ Classic algorithm of algorithms commonly used algorithm for public transport easy to use
1027
- 这是一个中序线索建立二叉树的程序希望能给用的上的人一点提示 ， -This is a clue in order to establish procedures for binary tree used in hopes of giving the person a little on the tips,
haxichazhao
- 依次输入关键字并建立哈希表，进行关键字查找。如果存在则返回待查元素的位置，否则显示不存在。-Enter keywords and in turn create the hash table, a keyword search. If there are elements of the location of unknown origin is returned, otherwise the show does not exist.
linst-reverse
- 单链表逆转 单链表逆转 单链表逆转 单链表逆转 -reverse the list
closetpair
- 最近点算法,求若干个点之间的最近点对间的距离，给出横纵坐标!-Nearest point algorithm, find the number of points between the nearest point of the distance between the vertical and horizontal coordinates are given!
quicksort
- 一种优化的快速排序方案，性能上挺好。值得推荐-An optimized quick sort program, the performance good. Recommended
infixpostfix.c
- infix to postfix conversion code.
HuffmanCodeTree
- Huffman编码树，也是最优二叉树，这个程序是用的huffman编码来编程的-Huffman coding tree, which is the most optimal binary tree, this program is to use Huffman coding to programming
pigeSort.tar
- 通过鸽巢排序实现对于数字在10000以内的排列。-For the realization of the arrangement within the digital pigeonhole sort through 10,000.
Circle-Area-a-Circumference
- Calculate circle area and Circumference-Calculate circle area and Circumference
Student.txt
- 冒泡排序的源码，这是一个用C++编写的一个源码，解决排序问题- bubble sort
floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-Floyd algorithm, also known as Freud algorithm, interpolation point method, is a given weighted graph to find the shortest path algorithm vertices.