资源列表
zhongshu
- 众数问题，半数集问题。还有算法书本2.5 2.9习题 每个问题代码均有运行时间统计代码在里面-Plural, half of the episodes. 2.5 2.9 Exercises algorithm books each code are run-time statistics code inside
sjjiegou
- 字典树应用,对输入文章建立字典树索引,极大降低单词搜索时间-The dictionary tree applications, the input articles to establish the dictionary tree index, which greatly reduce the search time of the word
filecfg
- 超轻量级的配置文件写入、读取工具。格式为key=value，每行一个。支持#注释。适用于嵌入式系统中，保存系统配置。-The ultra-lightweight configuration file is written to, read the tool. The format is key = value, one per line. Support# comment. Suitable for embedded systems, save the system configuration.
Sorting
- 排序算法，完成几种排序算法并进行比较-Sorting algorithm to complete several algorithm and compared
Shell-Sort
- 谢尔排序可以看作是一种插入排序的扩展方法与插入排序法相同的是，它们都是可以看作是一个个新的元素插入到已排好的数组里面的不同点是，在普通的插入排序法中，它是一个个元素比较，而在Shell s Sort中，相对多了一个步骤，改了一个步骤,其实两个合起来的改动就是多了一个概念，一个分治的概念,从代码实现的角度来看的话，就是多了一个调整步进的变量。-The Rochelle sort can be seen as an extension method of insertion sort and ins
CircularBuffer
- 环形缓冲区,固定大小，可循环利用的环形缓冲区-Circular Buffer
Havel-Hakimi-Theorem
- 此代码是图论Havel-Hakimi Theorem的实现，用于解决给出点集的入度数，判断一个图是否连通图-This code is shown in Figure On the implementation of the Havel-Hakimi Theorem, for solving the given point set into the degree to determine whether a graph connected graph
connected-components
- 此代码是基于数据结构算法分析的代码，用到图论中的深度优先收索法来求连通分支的问题，只要给出顶点、边数和相应的边就可以求出连通分支的数目-This code is based on the analysis of the code of the data structure algorithms used in graph theory depth-first closing cable method, as long as the given vertex connectivity of the
inorderAndpreorder
- 此代码是实现基于数据结构算法二叉树的原理，用递归的方法实现把中序遍历转换成前序遍历输出-This code is a recursive method based on the principle of data structure algorithms binary tree traversal sequence converted to pre-order traversal output
voting-system
- 此代码是模拟投票系统的实现，用于实现投票系统的功能，计算出最终票数的高低情况-This code is the realization of the mock voting system, to achieve voting system, calculate the final votes level of
bank-queuing-system
- 此代码是模拟银行顾客排队系统，用于计算某个时间断内在银行各个窗口服务的情况和顾客得到服务的情况-This code is simulated bank customer queuing system, used to calculate a time-off the inner bank window service and customer services
arrList
- 将一个含有N个元素的单链表逆置，非递归算法，辅助空间为常量，时间复杂度为O（n），详细运行内容和截图在Readme文档中-Inverse set of a singly linked list containing N elements, non-recursive algorithm, the auxiliary space is constant, the time complexity is O (n), run the content and screenshots in the REA