一 开发环境 OS: Windows 2000 Server + SP2 IDE: Visual Studio 6.0 + SP5 DataBase...

对二叉树结构作了清晰而简易的演示，可以帮助要了解二叉树结构和基本算法的人加深认识。可用VC直接编译运行。-On the binary tree structure was clear and simple presentation can help to understand the binary tree structure and the people a better understanding of the basic algorithm. VC can be used directly to compile run.

ORACLE数据库的交集查询-the intersection of inquiries

实现m阶B_树 （2）将线性表中的键值插入到B_树中（即建立索引）； （3）当删除和插入数据到线性表时，同时维护其索引B_树。 （4）可根据所给键值范围，输出该范围的所有键值-achieve m bands Containing tree (2) linear scale for the keys inserted into Containing tree (index); (3) When the deletion and insertion of data to the linear scale, while preserving its index Containing tree. (4) According to the pair, the scope of the output of all keys

我希望这个项目能给大学生带来好感

本程序所有数据库文件都以.sql文件保存在Database文件夹里； 2、首先在SQL查询分析器中运行CreateDatabase.sql文件创建数据库； 3、运行其他所有的.sql文件即可创建好了本程序的数据库；-documents to the database. Sql file stored in Database folder; 2, the first in SQL Query Analyzer run CreateDatabase.sql database file creation; 3, running all the other. Sql documents can establish a better process of the database;

免费的Delphi控件，可以替代BDE，直接访问.dbf数据库-Free Delphi ActiveX component,replace BDE and direct access .dbf database

一个用自适应维纳FIR滤波器消除脑电波中的干扰（转）-an adaptive Wiener FIR filter brain waves to eliminate the interference (switch)

pb 源码 进度条例子-pb progress of the sub-source

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

用Delphi开发的经典的数据库系统-with the classic Delphi database system