资源列表
BroadSearch
- 实现了8数码问题，用的是广度优先搜索算法,广度优先算法属于盲目搜索，效率不高-eight_num problem
STL_quene
- 用c++的STL实现大根堆和小根堆，实现相当方便简单，优先队列效率好-Large root heap and small root heap, quite simple priority queue efficiency c++ the STL
linklist.tar
- 多叉树实现，抽象树节点内容，用回调函数实现内容创建 比较 销毁 -Multi-tree realization of the abstract tree node content, using a callback function to achieve content creation compared the destruction of
Matching-parentheses
- 数据结构中堆栈的应用。。 输入一串字符串（含有小括号） 判断括号是否匹配-Stack data structure. . Enter a string (with brackets) Determine whether the brackets match
beibao
- 背包问题，可以解决最短路径问题，或优化问题-Knapsack problem, the shortest path problem can be solved, or optimization problems
search
- 索引顺序表查找,索引顺序查找即分块查找，是将顺序表分成诺干块。-Indexed sequential table lookup, the index in order to find that the search block is to the order of the table is divided into Nokan blocks.
ophcrack-3.3.1
- 彩虹表实现源码，是在windows下的彩虹表实现，包括构造、排序和查找-the source of rainbow,implement the search,look up and sort
the-num-k-element
- 寻找中项和第k小元素 通过使用线性时间分析的数学方法 从而找到第k小元素 而不用排序以后再找-you can find the middle element and the num k element in a array which is not originally sorted
graph
- 用VC对数据结构图进行了基本操作，包括建立图结构，插入节点，边，删除节点，边，等等。-VC on the data chart with the basic operations carried out, including the establishment of graph structure, insert the node, edge, remove the node, edge, and more.
DeepSearch
- 实现八数码问题的深度优先搜索算法，这是一种盲目搜索，搜索效率比广度优先搜索还低，这个算法实现有一定的难度-Search
C-algorithm
- C算法程序集的第二版的原程序，包含有几佰个最常运用到的子程序和算法-C algorithm for assembly of the second version of the original program, where hundreds of the most frequently contain routines and algorithms applied to
JsonLib
- 解释json格式的类，我添加了支持UNICODE文本,并修改了一些bug-Json format to explain the class, I added support for UNICODE text, and revised a number of bug