资源列表
queen
- 运用回溯法解决8皇后问题，进而可以使用本方向推广到N皇后问题。-The use of backtracking to solve 8 queens problem, in turn, can be extended to use the direction of N Queens problem.
C和指针的源代码
- 这是C和指针这本书上例题的源代码，用C写的，与书相配套，是学习的好资料。
slm.tar
- 利用剑桥的SLM工具包实现的一个计算ngram的代码，可以完成1-3元模型的训练以及压缩。压缩算法是利用相对熵策略压缩。-Using the Cambridge SLM toolkit to achieve a calculated ngram code, you can complete the training as well as compression of the 1-3 model. The compression algorithm is the use of compressio
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.