数据结构示例。适用于对数据结构有一定基础的人研究练习

统计学生成绩表中各分数段学生人数，用列表框返回结果。-Statistics of student achievement scores above table the number of students, using the list box to return results.

这个源程序是关于无向图的邻接表生成和显示的，可以用这个程序实现-the source of the undirected graph generation and adjacent table shows, this procedure can be used to achieve

双线程对一系列随机数进行归并排序，使用MFC的控制台程序-Dual-threaded on a series of random numbers to merge sort, using the Console application in MFC

VB的数据库访问与例程解析。在测试源程序时，一定要把所有文件放在同一个目录下面-VB database access and analysis routines. In testing at the source, all the documents must be placed with a directory

sqlite当前使用较方便的桌面数据库。如果使用远程访问sqlite数据库。该文件是sqlite客户端程序的简单测试程序，使用netSqlite的接口。配合sqlie服务器代码，能够访问远程服务器上的sqlite数据。

企业售后管理系统-enterprise management system sale

仓库管理系统VC源码 在运行程序之前，请将所附的数据库文件dms.mdb添加为数据源，并命名为DMS。-Warehouse Management System in VC-source operating procedures, I would be grateful if the attached document dms.mdb database to add data sources, and was named to the DMS.

这是我的数据结构课程设计,经过我1周左右时间的润色,相信会对正在学习数据结构的人们有些用处-This is my data structure curriculum design, a week after I lay around, I believe it is currently studying the data structures useful in some people

这是一个使用c代码访问mysql的简单方法。请检查asdasdadasdasdasdasdsasdaasdad，asdasdasdadadadadadadadadadadadadadadadadadqeqewqedcxzczczczxzxasdas，asdsasdasdadaqeweqeweqewew

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