an improved Boyer

this a program for for database implement in this we are implementing several join algorithms

使用VC编写的栈的链式表示和实现程序，简单明了，方便使用-Prepared using the VC stack chain expression and realization of program, simple and clear, easy to use

用VB6创建的家庭地址簿程序。制作该程序的主要目的是用来为家庭中的每个成员存储个人地址信息。而且该程序的用户设定为两个类型级别：即1管理型、2用户型-built with VB6 family address book procedures. The production process is the main purpose for the family members of each of the addresses stored personal information. And the procedures set of users for the two types of levels : that is a management-type, two-users

四则运算实现，这个算法是用C语言实现的，算法程序代码明确易懂。-four Operators realize that this algorithm is used to achieve the C language, the algorithm code clear and understandable.

这是一个旅行商问题的算法源程序，代码较为简短，说明详细，可读性好。压缩包里面只包含源程序文件，要在vc上面运行。-This is a traveling salesman problem algorithm source code, code brief that detailed and readable. Compressed they contain only source files to run above the vc.

用C实现的基于O-tree的ic设计布图布线工具源代码,有相关文档-C realized based on O-tree-id wiring layout design tools source code, related documentation

数据结构的java实现-Data Structure written in Java for Huffman Coding Algorithm.

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

这段代码被针对医院管理通过与 oracle 采用 vb6.0 做为一个后端服务器。它保持像医生详细信息、 病人的细节、 登录和注销应用程序。

这是我制的，调试过，小意思别见笑可以将输入的两字符串进行比较相等返回0，不等时返回两字符串的差值-This is my system, and the debugging that other small token of kindly feelings can be a laughing stock of the two input strings equal to 0 comparison, the returns ranging from two strings of the margin