资源列表
C++链表模板
- 编写了一个链表的模板，方便需要的人移植调用等，简单易懂(Write a list of templates, convenient for people to transplant, call, etc., easy to understand)
ConsoleApplication7
- 涵盖了多个查找算法，能够实现对数据的查找(this is a algorithm that it can be use to search something you want to find in a group data)
快速排序
- 选取一个关键码key，一趟排序将要排序的数据分割成独立的两部分，key前的元素都小于key, 靠后的都大于key, 然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。(Select a key key, the two part of a sort to sort the data into independent, key elements are less than key, later than key, then according t
最小生成树
- 给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)
KMP
- KMP算法是一种改进的字符串匹配算法，由D.E.Knuth，J.H.Morris和V.R.Pratt同时发现，因此人们称它为克努特——莫里斯——普拉特操作（简称KMP算法）。(KMP algorithm is an improved string matching algorithm, discovered by D.E.Knuth, J.H.Morris and V.R.Pratt simultaneously, so people call it Knut Maurice Platt ope
成绩的ABC等级
- C语言数据结构教学，统计各门课程各分数段人数，并按总成绩排序(C language data structure teaching, statistics of each course, the number of scores, and according to the total score sort)
Heap
- 数据结构中堆结构，数据结构包含各种结构，包括各种树形结构，以及图等等(Data structure heap structure)
file
- 将图的数据写入文件并构造邻接矩阵，求出单源点到其他顶点的最短路径(The data of the graph is written into the file and the adjacency matrix is constructed, and the shortest path from the single source point to the other vertex is found)
Exp_Jos
- 数据结构中的实验，约瑟夫问题，C++实现(Data structure in the experiment, Joseph problem, C ++ implementation)
Express2
- 数据结构实验，四则运算表达式，C++实现(Data structure experiment, four operation expression, C ++ implementation)
Priority2
- 数据结构实验，优先队列与堆，C++编程实现(Data structure experiment, priority queue and heap, C ++ programming implementation)
Graph2
- 数据结构实验，内容是有关图的遍历，C++编程实现(Data structure experiment, graph traversal, C ++ programming realization)