数据结构的课后练习

BM关键字查找算法，在用于查找子字符串的算法当中，BM（Boyer-Moore）算法是目前相当有效又容易理解的一种，一般情况下，比KMP算法快3-5倍。-BM keyword search algorithm used in the sub-string search algorithm which, BM (Boyer-Moore) algorithm is quite effective and easy to understand A, under normal circumstances, more than 3-5 times the KMP algorithm quickly.

这是我学习数据结构与算法时编的关于队列操作的程序，对学习数据结构的朋友有帮助-This my learning algorithm and data structure when the series of the operation of the queue on procedures for the study of the data structure to help friends! !

数据结构效验算法-data structure well-tested algorithm

 ；文件O显示：读取数据从文件和cab可以传输您想要的格式。

科研管理系统是用PoerBuilder编写-research management system is used to prepare PoerBuilder

扩充了C++ Builder DBGRID 控件的功能，实现隔行变换颜色等功能-Expansion of the C++ Builder DBGRID control functions, the realization of interlaced color transform functions

纯C语言写的小型通用数据库，一个C数据结构组科技小组的作品，附有开发思路PPT，这可是一个宝贵的资源哦，更底层的东西，运行于DOS提示符，可以新建数据库等操作。C的编程高手们值得参考一下。-Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!)

c常用算法，用语言编写，为本人数据结构与算法设计作品，在VC++环境下编译通过-c commonly used algorithm, the language used to prepare for my data structure and algorithm design works in the VC environment compile

ORACLE数据库的很好的PPT教程，希望对大家有所帮助-ORACLE database PPT excellent tutorial we want to help