yuesehuhuan

说明：  约瑟夫问题，四种解法，分别是静态链表，顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)

说明：  、实验目的 1 熟练掌握各种内排序方法，深刻理解排序算法及其执行过程； 2 学会分析各种内排序算法的性能； 3 了解各种排序方法的优缺点，对于实际问题能够选择一种较好的排序方案； 4 熟练掌握图的存储结构； 5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。 6 了解图的最小生成树算法。 (Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods.)

说明：  nuaa1108 多少连续的1 解题报告(Problem solving report )

本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)

基于数据结构的图书管理系统，基本功能都有，可以拿来作为数据结构的课程设计(Based library management system data structures, basic function, can be used as a data structure of the curriculum design)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)

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

本程序实现一元多项式合并。本程序输入方式为按项输入，每输入一个项，会先提示输入项的幂，再提示输入项的系数。(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.)

主要是DIJKSTRA经典算法，可以作为单个算法来读，也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)

普利姆算法用来求解最小生成树问题很容易，使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)