数据结构里的dfs算法，包括递归与非递归。用vc6.0编写

MyDB 是一个小型、 快速、查询方便的桌面数据库。 适用于Visual C++、Visual Basic、Delphi等开发者。 只有一个DLL（188KB），所有数据以自己的格式存 在一个普通文件中，无需Dao、Ado、BDE等支持。 也无须任何安装和设置。特别适合开发那些数据量 不是很大，无需复杂查询，又不想安装Dao等一大堆 DLL，OCX的绿色软件。而且数据安全性好， 无法轻易打开！-MyDB is a small, fast and convenient desktop database query. Applies to Visual C++, Visual Basic, Delphi and other developers. There is only one DLL (188KB), all data in their own format, there is a general document, without Dao, Ado, BDE and other support. Also without any installation and settings. Particularly suitable for the development of those who is not a big amount of data without the complexity of inquiries, but also do not want to install a lot of Dao, such as DLL, OCX green software. And data security, and can not be easily opened!

哈夫曼编码(Huffman Coding)以哈夫曼树─即最优二叉树，带权路径长度最小的二叉树，经常应用于数据压缩。-Huffman coding (Huffman Coding) ─ a Huffman tree that is optimal binary tree, with the right of the path length of the smallest tree, often used in data compression.

CResultSet 连接数据库并进行必要的数据操作！-CResultSet Link AccessDatabase!

这项计划是包括招生过程中，搜索某一特定记录的学生和修改和更新的记录和该程序还提供了 2 份报告的学生。

迷宫算法（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.

ACESS数据库使用时间长了之后,数据库文件后变得越来越庞大,本程序里的函数可以实现对ACESS进行压缩 另外,当机器突然断电,可能对DB造成损坏,该函数也可实现修复-Acess database to use a long time after the database file after becoming increasingly large, the program can realize the function of Acess to compress the other hand, when a sudden power failure the machine may cause damage to DB, this function can also realize Repair

这是一个在线购物车系统，用户可以使用所有的servlet概念，并可以通过在线购买商品。

该源码功能是实现赫夫曼编码，即构造最优二叉树，是字符界面的，自我感觉做的还不错，调试通过的，绝对好用-The source function is to realize Huffman coding, that is, the optimal tree structure is a character interface, and the sense of self, to do good, debugging adopted, the absolute ease of use

数据结构中的各种排序,只要输入一定的数据就可以实现排序,显示结果-Data structure in a variety of sort, as long as the importation of a certain sort of data can be achieved, the result will be displayed

顺序查找 实现顺序查找的设计与实现 且加上了注释 更容易理解和上手-Find the order of search in order to achieve the design and implementation and the addition of annotations easier to understand and get started