严蔚敏编写的《数据结构》第3章的答案，全部为源码

本程序所有数据库文件都以.sql文件保存在Database文件夹里； 2、首先在SQL查询分析器中运行CreateDatabase.sql文件创建数据库； 3、运行其他所有的.sql文件即可创建好了本程序的数据库；-documents to the database. Sql file stored in Database folder; 2, the first in SQL Query Analyzer run CreateDatabase.sql database file creation; 3, running all the other. Sql documents can establish a better process of the database;

按照前序非递归遍历二叉树，递归法将二叉树的左右子树互换-In accordance with the pre-order traversal non-recursive binary tree, binary tree recursive method will swap the left and right subtree

图的深度优先遍利 图的深度优先搜寻法 有注释-Fig times the depth of Victoria map priority depth-first search method has the Notes

trigger示范程序-trigger example program

strassen算法的扩展，可以计算任何偶数阶矩阵的相乘，一般strassen只能计算2的n次方阶（自己编写，英文注释~）-Strassen expansion algorithm can even order any calculation of matrix multiplication, general Strassen only two terms of the n-th-order (to prepare themselves, English Notes ~)

ACCESS VBA编写系统托盘源程序源码，效果很不错-ACCESS VBA source code to prepare the system tray, the effect is pretty good

想做个图片存取的程序，可JPG不行。请帮看一下。-Want to be a picture of the program access can not JPG. Please help to look at.

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

基于java开发的OS中经典PV算法：生产者和消费者算法的演示。-Java-based OS development of PV in the classical algorithm: algorithm for producers and consumers of the presentation.

它是在 c + + 中的 b + 树实现，是用来查找、 插入和一次晚点的节点，并且我们可以创建到使用的虚拟磁盘