“数据结构、算法和程序”这个抽象世界的特殊旅程，以解决现实生活中的许多难题...

一个很好的通讯录管理系统-a very good correspondence management system

省市区县(含全国完整数据库)Ajax代码，功能详细，可完全适用。-Provincial and municipal districts and counties (including the national integrity of the database) Ajax code, functional details can be fully applicable.

n后问题,实现n后问题的求解,并且可以输出最有解-n, n after realizing the problem solving, and can export most Solution

Viterbi算法源程序,注释简洁,利于使用-Viterbi algorithm source, concise notes, beneficial use

这个

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

数据结构比较有用的源程序代码,各种功能函数的实现-Data structure more useful source code, and a variety of performance function to achieve .............

数据结构 算法与应用 C++语言描述 机械工业出版社，完全非扫描高清版 配有答案和程序-Data structures algorithms and application of C++ Language description of Machinery Industry Press, completely non-scanning high-definition version with the answer and procedures

使用递归的方法实现的算式分析器，给定一个符合C语言格式的算式，可以使用括号，单目运算符等，计算算式的运算结果。-use recursive method formula Analyzer, to set a C-language format with the formula, you can use brackets, Monocular Operators, calculation formula of the calculation results.

求出任意两个序列的最长公共子序列,使用了动态规划的方法-Obtained the longest sequence of any two common sub-sequences, the use of dynamic programming methods