polynomial

队列的顺序存储结构和操作实现 队列的顺序存储结构和操作实现(The order of the queue storage structure and operation of the order of the realization of the queue storage structure and operation of the realization of)

根据队列搜索算法的基本思想，现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能，可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of ​ ​ the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)

就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)

数据结构课程设计，多种内部排序的效率分析(Data structure course design, the efficiency of a variety of internal sorting)

多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂(suoxiangshi jiajiancheng)

使用全排列实现hash，看看吧相信对大家会有些帮助的(Full array hash)

给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)

数据结构快速排序例程代码，只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)

该程序是数据结构中以链表存储形式来求两个集合的交集，用C++语言描述的(The program is the form of a linked list stored in the data structures to seek the intersection of two sets, C++ language to describe)

长整数四则运算,利用双向循环链表实现长整数的存储，每个结点含一个整形变量。 (Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)