有一个魔王总是使用自己的一种非常精练而抽象的语言讲话，没有人能听得懂，但他的语言是可以逐步解释成人能听懂的语言，因为他的语言是由以下两种形式的规则由人的语言逐步...

魔法单词记忆――DAO访问ACCESS数据库-magic word memory-- DAO visit ACCESS database

约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。-Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.

线性表常用算法集合，含所有线性表基本的算法，与吴伟民编的数据结构书完全配套，用TC实现，经过运行。-linear algorithm commonly used pool table, table containing all the basic linear algorithms, and Xiulan WU Weimin series of the data structure was fully complementary with TC realization, after running.

Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a

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

实现树的创建算法，创建一个至少包含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.

vfp数据库应用编程-Probe Database Application Programming

站长以前写的informix通用开发包源码，用c和ec编写-common code for infomrix,c and ec

数据结构银行模拟指导-simulation data structure to guide banks

aql介绍，适合入门者学习 aql介绍，适合入门者学习-Aql introduction, suitable for beginners to learn Aql introduction, suitable for beginners to learn