用JAVA开发的数据库底层核心，是学习用JAVA开发数据库系统的必要资料。...

门店管理系统用于管理交易，库存系统用于管理库存明细。

公文管理系统源码，内附数据库，可运行，可调式-Source document management system, containing a database, run, adjustable

运动会成绩分析统计，数据结构实验课题的一个项目-Sports Performance Analysis of statistics, data structure, a project of experimental subjects

无需密码,直接解压,是老师布置的二叉排序树的C语言代码,适合学生使用.-without passwords, directly extract, is a teacher decorated tree ranking two forks of C language code, for use by students.

数据结构里面实现图：拓扑排序、最小生成树、关键路径、深搜、广搜、优先路径

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

本文介绍了数据结构中的选择排序，希尔排序等算法，采用全英文版，真实可靠-This paper introduces the data structure of choice, in order of ranking algorithms such as Hill, was used in English, true and reliable

用API改变ACCESS窗口的背景的例程-Using API to change the window background ACCESS routines

欢迎下载学习 它很容易理解 贝叶斯分类器，例如，易于理解和适用于模式识别

冒泡排序算法，最基础的Bubble sort 算法，经典-bubble sort