资源列表
3.4.3
- 单链表L中的结点是按值非递减有序排列，算法实现将值为x的结点插入表L中，使得L仍然有序。-Nodes in a single linked list L is non-decreasing ordered by value, the algorithm will node is inserted into the table L x such that L remains orderly.
3.4.6
- 单链表中的数据元素含有三种字符（字母、数字、其他字符），算法实现构造三个循环链表，是每个循环链表中只含有同一类字符，且利用原表中的结点空间作为这三个表的结点空间。-Singly linked lists of data element contains three characters (letters, Numbers and other characters), the algorithm constructs three circular linked list, each cycle l
3.4.7
- A、B、C为三个元素之递增有序的线性表，对A作如下运算，删去既在B中出现又在C中出现的元素。分别以顺序存储结构和链式存储结构实现。-A, B, C for the three elements of increasing order linear list, to make the following operation, A cut in B and appear in C elements. With sequential storage structure and chain store
4.4.1
- 判定给定字符向量是否为回文（从左向右读和从右向左读相同的字符序列）。-Determine whether a given character vector palindrome (reading from left to right and right to left reading the same sequence of characters).
mintree
- 一个连通图可以有多个生成树，实际应用中希望所选的生成树的权值总和最小，这就是最小生成树的问题。代码实现用Kruskal算法实现求解最小生成树。-A connected graph can have multiple spanning tree, hope in the actual application of the selected total weight minimum spanning tree, this is the minimum spanning tree problem. C
minimum-spanning-tree_prim
- 用C++实现的最小生成树,使用Prim(普里姆)算法.-C++ achieved with the minimum spanning tree, using Prim (Prim) algorithm.
minimum-spanning-tree_Kruskal
- 一个C++实现的最小生成树,使用的是Kruskal(克鲁斯卡尔)算法.-C++ achieve a minimum spanning tree, using the Kruskal (Kruskal) algorithm.
AhoCorasickAlgo_Demo
- C#实现的AhoCorasicko多模匹配算法，并有简单的使用demo-AhoCorasicko multimode matching algorithm C# implementation, and simple to use demo
Convert-arbitrary-hexadecimal-number
- 将十进制数转换为任意进制数，C语言代码，可以直接运行-Converts a decimal number to an arbitrary hexadecimal number, C language code can be run directly
Genetic-Algorithm-
- 用遗传算法解决0_1背包问题，比较经典,适合做参考论文-0_1 knapsack problem solving using genetic algorithms, more classic, suitable reference paper
kruskal
- 求加权连通图的最小生成树的算法示例，两个经典的最小生成树算法的较为简单理解的一个算法-Find weighted connected graph algorithm examples of the minimum spanning tree, two classic minimum spanning tree algorithm is relatively simple to understand an algorithm
MS
- 微软2014实习生在线测试题 详解 ac得分1-Microsoft Interns 2014 online test questions