binarytree

本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)

二叉树实现，整个包为VS工程。包含了二叉树的基本功能(Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree)

迪特斯特拉算法，课程设计的作品，主要计算站点距离的吧，可以看看(Dieter Stella algorithm, distance course design work, the main computing sites can look)

希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )

采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)

本程序实现一元多项式合并。本程序输入方式为按项输入，每输入一个项，会先提示输入项的幂，再提示输入项的系数。(This procedure combined to achieve a dollar polynomial. This procedure according to entry input methods for the input, one for each input item, it will first prompt entry of the power, and then prompts entry of the coefficient.)

哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)

霍夫曼编码实验报告，内含源代码，编码原理 (Huffman coding lab report, containing the source code, coding theory)

数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)

演示进程调度算法 使用的链表 包涵7个功能 4个算法(Process Scheduling Algorithm Demo )