资源列表
SeqList
- 线性表的基本功能实现，包括初始化，插入操作，删除，取值，显示-The basic function of the linear form of implementation, including initialization, insert, delete, values, display, etc.
2--Binsearch
- 利用C语言二分查找的算法实现，供大家参考-Using C language binary search algorithm for your reference
graph-algorithm
- 图论算法，包括最短路算法、最小生成树、图的连通性、网络流、匈牙利算法等等源码-graph algorithm
sort
- 快排和插入和冒泡和选择和希尔和基数和堆和归并八种排序-Fast row and insert and bubbling and the selection and Hill, and the base and the sort heap and merge eight
point
- 用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方-Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity)
Permutate
- 用调换数字法实现全排列，并与stl中的函数进行了比较。-With exchange digital method to achieve permutation, and with the stl function were compared.
Expression-evaluation
- 任意输入数学运算表达式分别采用两种算法求值，分别是中缀表达式直接求值和修改成后缀表达式求值。表达式中包含的运算符有：加法+，减法-，乘法*，除法/，括号()，乘方#等运算符。运算符的优先级和结合性符合数学运算法则-Any input math expressions using two algorithms evaluated, infix expression directly evaluated and modified the postfix expression evaluation.
11111
- 数据结构中关于邻接表与邻接矩阵的四个算法，包括源码，亲测可用-Data structure on the adjacent table and the adjacency matrix of the four algorithms, including source code, the pro-test can be used
Sort_Cmp
- 比较快速排序和冒泡排序的时间消耗，随机产生输入范围内的数交分另排序，比较两者用的时间-More quick sort and bubble sort of time consumption, randomly generated within the scope of the input into the other sort several points, compared with both of the time
string
- C++设计字符串类1) 能够用 “+” 来处理两个字符串的相加；2) 具有在一个字符串中搜索一个字符的功能；3) 具有在一个字符串中搜索另一个字符串的功能；4) 实现去除字符串最前面和最后的空格的功能；5) 编写一个main()函数，测试你的字符串类的各种功能。-C++ design string class 1) can use " +" to deal with the addition of two strings 2) has a function to search
List
- 链表的基本操作，包括插入，删除确定位置的字符，删除确定字符-List of the basic operation, including insert, delete determine the location of the characters, delete characters to determine
Dijkstra
- 用c++实现最有向连同图的短路径算法。图的路径带有权值。-With c++, together with plans to achieve the most short-path algorithm. That path with the right values.