资源列表
1025_1010
- ZJU ACM 1010排名第一的程序. 1025的高效程序
huffumancoding
- 实现霍夫曼编码与解码，通过构造霍夫曼树编程实现-Huffman coding and decoding achieve
BaseSort
- (2)已知序列{503，87，512，61，908，170，897，275，652，462}，采用基数排序法对其作升序排序，打印每一趟的结果。-(2) the known sequence {503,87,512,61,908,170,897,275,652,462} method of its use radix sort for ascending order, print the results of each trip.
exp9-4
- 输出在一棵二叉排序树中查找某个关键字k经过的路径。-Find a keyword k output through the path of a binary sort tree.
string_match
- 串匹配算法,KMP,QS,Horspool,RP
Binary_tre1762296262004(1)
- 程序用于实现二叉树的建立及先序中序后序的遍历
dj
- 算法最短路径，利用迪杰斯特拉算法来设计求任意两点最短距离-Shortest path algorithm, Dijkstra algorithm is used to design the shortest distance between any two points demand
8puzzle_dfs
- 实现了八数码问题，运用了图搜索中的DFS（深度优先搜索）。-翻译 实现了八数码问题，运用了图搜索中的DFS（深度优先搜索）。 The implementation of the eight digital issues, the use of the map search DFS (depth-first search).
huffman
- 能简单的实现哈弗曼树编码，内容简单且有注释。将哈弗曼树编码简明的呈现出来。-Can realize a simple Havermann tree coding, content simple and annotated. The Havermann tree coding concise show.
sorting
- 多种排序方式的结合（冒泡排序、选择排序、堆排序、希尔排序、快速排序、二进制排序、归并排序）-The combination of a variety of sort (bubble sort, selection sort, heap sort, shell sort, quick sort, binary sort, merge sort)
123
- 网络流算法和最小费用流，用来处理图论问题中的流量计算和流量限制的费用流计算-Network flow algorithm and the minimum cost flow problem in graph theory to deal with the cost of computing and traffic flow restrictions stream computing
7
- 用递归算法进行计算斐波那契数列，这是一种c++程序-Calculation of the Fibonacci series