preparation classes directory c

access2002数据库管理实务 超星格式图书-access2002 database management practices Superstar format books

基于VC编写的可嵌入WINDOWS的等值线的生成源码.-prepared by the VC can be embedded Windows contours of the generation source.

实验中我们使用了四种方法进行串匹配，通过对相同的文本和相同的模式串进行四种不同算法的串匹配操作，比较四种算法的优劣。-Experiment we used four methods for string matching, through the same text and the same pattern for four different algorithms string matching operation to compare the merits of the four algorithms.

设编号为1，2，···，n的n个人围坐一圈，约定编号为k（1≤k≤n）的人从1开始报数，数到m的那个人出列，他的下一位又从1开始报数，数到m的那个人又出列，依次类推，直到所有人出列为止，由此产生一个出队编号的序列。

用短小的c语言编出了精湛的通讯簿，值得一看 包含了插入 删除 排序等一系列操作。-notebook

实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是否在此树中作为叶子结点。-To achieve the creation of the tree algorithm, to create at least a three-layer, 8 nodes of a binary tree, and after this tree in order to achieve the first recursive traversal algorithm. Output the results of three kinds of traversal. And then to achieve a leaf node search algorithm to determine whether a given value in this tree as a leaf node.

数据结构中的B-TREE的实现-data structure of the B-TREE Implementation

本程序比较各种排序算法的优劣（包括快速比较，基数比较等等），希望大家指教．-the procedures compare the merits Sorting Algorithm (including rapid comparison, the comparison base, etc.), we hope the exhibitions.

c语言数据结构源代码（全）相当经典-c language data structure source code (all) is a classic

二叉树有三种遍历方法，引用树的概念实现遍历-There are three methods of tree traversal, invoke the concept of tree traversal realize