一个增加数据库字段的例子，db数据库格式，有兴趣地可以实施...

一个基于VC+ACCESS的酒店业务管理系统，内附说明书-a VC-based ACCESS hotel operations management system, enclosing brochures

This code supplements the tutorial in Finite State Machines

集束搜索,经典算法，不用过多介绍了吧/。-cluster search, classical algorithm, not too many on the Bar /.

是一个很好的c++家族管理系统-is a good family management system c

数据结构哈希表的实现，用C++写的，比较完整-Hash table data structure to achieve, using C++ Written relatively complete

清华大学数据结构课上实现的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;

求最大公约数的三种算法，程序中还对这三种算法进行了比较-Common denominator for the three algorithms, the procedure is also the three algorithms are compared

本文是介绍数据结构中的二分查找，比较数等思想及算法的-this paper is to introduce the data structure to search two hours, a few more ideas and algorithms

超市或杂货店，自助服务商店提供种类繁多的食品和家用商品，组织到各部门。

功能实现：1).输入，显示各个学生信息 2)．根据学号，姓名查找某个学生的成绩 3)．修改学生信息 4).删除学生信息 5） 清空数据库6）选择范围的输出学生成绩排名。-Function achieve: 1). Input, display individual student information 2). According to Student ID, name to find a student" s achievement 3). Modified Student Information 4). Remove Student Information 5) Clear the database 6) Select the output range of student achievement rankings.