The database of the agricultural enterprise

这是一个关于打印技术的的源码，通过access数据库将数据打印到我们的所需清单上-This is a print technology on the source, access the database through the data required for printing to our list

著名的15谜游戏（15-puzzle ）的Tcl/Tk版本，现在它可以有 4x4, 5x5 或6x6 的格子，所以更加有趣，改变图片也更加容易。 -mystery of the famous 15 games (15-puzzle) Tcl/Tk editions, it could 4x4, 5x5 or 6x6 lattice, the more interesting and change the picture much easier.

Matlab提高篇介绍了Matlab的语言的一些基本格式。同时提供了丰富的实例，让读者整整体会该语言。-Matlab increase of the Matlab language, the basic format. While providing a wealth of examples to enable readers to a full understanding of the language.

堆栈的实现代码，实现了栈的所有功能，PUSH，POP，插入，销毁，清空等，有调试程序，可以很清楚的看到栈的运行过程-Realize stack code, realize all the features of the stack, PUSH, POP, insertion, destruction, empty and so on, have a debugger, you can clearly see the operation of the process stack

实现循环扩容队列

是数据结构中的内部排序算法-data structure is an internal algorithm

二叉树的一些基本实现：具备功能：创建、删除二叉树（包括文件读取录入信息），先中后根显示二叉树（递归算法），结点信息查询（包括：结点所在层数，结点孩子个数，结点在先中后根排序中的位置、寻到结点路径长度），二叉树相似度比较；附带注释，界面友好，代码是在VC6.0下写的。

程序　请认真书写上传资料的详细功能、包含内容说明-c

约瑟夫环算法实现，能实现约瑟夫算法，利于初学者更好的学习数据结构-Josephus algorithm, the algorithm can achieve Joseph, which will help beginners learn better data structure

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