清华版数据结构实验要求的的哈希算法原程序

这是我学习数据结构与算法时编的关于队列操作的程序，对学习数据结构的朋友有帮助-This my learning algorithm and data structure when the series of the operation of the queue on procedures for the study of the data structure to help friends! !

MySql，Access ADO操作数据库强大封装类 功能满足大家的需求 C++源码，有需要的下载吧

航空票务预订系统-Air Ticket Booking System

解析中央气象局下发的台风报文，提取有用信息，入数据库-Analysis of the Central Weather Bureau issued a typhoon message, extract useful information into the database

这是一个改进了自顶向下的归并排序，它改进的地方主要有：采用小子文件截止的机制，当序列长度小于32时，采用直接插入排序；对归并的内循环作了优化，判断的次数更少。-This is an improvement from a top-down sort of merger, it improved the main : the deadline for the paper boy mechanism, the length of the sequence is less than 32, the use of direct insertion sorting; Merging with the right circle made optimization, the number of less judgment.

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

模拟实现锁管理器-Simulation lock manager

用Delphi写的备份sqlserver数据库的小工具-write with Delphi SQLServer database backup small tools

分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.

Dapper-一个简单的.Net对象映射程序