linked

矩阵运算器，c语言编程，数据结构，免费下载(Matrix calculator, c language programming, data structures, free download)

多项式求和，用链表实现的一元多项式求和程序，比较 靠谱(Polynomial sum, with the linked list implementation of a polynomial summation procedure, more reliable)

数据结构的课程设计，做的是一个交通查询，主要用到图的算法，和大家共享，欢迎指正！(Data structure curriculum design, do a query traffic, mainly used graph algorithms, and share, please correct me!)

数据结构计算算术表达式算法，可以计算小数点及较复杂的运算表达式(Data structure algorithms calculate arithmetic expression, we can calculate the decimal point and more complex operations expression)

一个MFC编的算法分析课程设计实验“重排九宫源码”(MFC compiled an algorithm analysis course design experiment " rearrangement kau kung source" )

Devil language 数据结构中的经典问题 此为问题!(Devil language data structure of the classic problems of this problem!)

用c++实现的haffman tree 小程序，仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)

该文件描述了排序算法的实验指导报告，通过本实验，你可以了解插入排序、选择排序、希尔排序、堆排序、冒泡、双向冒泡、快速排序、归并排序、递归的归并排序、基数排序等多种排序方法的实验(The document describes the experimental guidance of the sorting algorithm, through this experiment, you can learn about the insertion sort, selection sort, shell sort, heap sort, bubble, two-way bubble, quick sort, merge sort, merge sort recursive basesorting a variety of sorting methods experiment )

设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)

Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)