MyDB 是一个小型、 快速、查询方便的桌面数据库。 适用于Visual C++、Visual Basic、Delphi等开发者。 只有一个DLL（1...

提醒的例子，大家可以去看看 -Remind example, we can go and see

北大在线OJ 1100题，运用自动机成功求解方程式的经典例子，此程序可作为自动机模板-OJ 1100 North online title, the success of the use of automata to solve the classic example of the equation, this procedure can be used as a template automaton

数据结构 详细描述了如何创建二叉树的方法以及操作-Data structure described in detail how to create a binary tree method and the operation of

文件与IO存取,数据绑定,数据库更新,章立民的程序-Documents and IO access, data binding, database updates, rules and procedures for public

AdoRWAcce

超市选址，用数据结构，求最小生成树问题。自设计算法为超市寻找一个最短路径。-Supermarket site, the data structure, and minimum spanning tree problem. Since the design of algorithms for the supermarket to find a shortest path.

Town是一个100% 纯Java API，它位于JDBC API的顶部。这个API的目的是简化和一个JDBC兼容的关系数据库的交互。通过使用Town,可以执行和管理select/insert/update/delete　SQL语句，而不用真正写一行SQL。Town也可以使用任何JDBC连接字符串和内部连接池。-Town is 100% pure Java API, it is located JDBC API the crown. This API goal is the simplification and a JDBC compatible relational database interactive. Through uses Town, may carry out and manage select/insert/update/delete the SQL sentence, but does not need truly to write line of SQL. Town also may use any JDBC to connect the character string and internal connection pond.

折半查找算法,实现对于一组数据的查找操作,利用折半查找法进行查找-binary search algorithm, to achieve a set of data for the search operation, the use of binary search method you

1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。 程序如下： #include #include #include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af

数据结构词典（英文）-data structure Dictionary (English)