ACCESS常用窗体查询，例举多种窗体查询的方法

输入字符串以链表的形式存储，在链表中查找一个元素，删除一个元素-Enter string to the list in the form of storage, find an element in the list, delete an element

穷举密码算法 /在许多情况下我们需要穷举组合的算法，比如密码词典。 //这个算法的关键是密码下标进位的问题。 //另外本例子中的写文件语句效率比较低，为了降低算法复杂度没有优化。 //如果要提高写文件的效率，可以使用缓冲区，分批写入。-Exhaustive Cipher/In many cases we need to exhaustive combinations of algorithms, such as the password dictionary.// This algorithm, the key is password subscript binary problems.// Another example of this statement to write a document relatively low efficiency, in order to reduce the algorithm complexity is not optimized.// If you want to improve the efficiency of writing documents, you can use the buffer, write in batches.

二叉树的动态链表存储结构及表示，二叉树的三种遍历算法（递归和非递归两类）运用二叉树三种遍历的方法求解有关问题-Binary tree structure and the dynamics of linked list is stored, said three kinds of binary tree traversal algorithms (recursive and non-recursive types) the use of three kinds of binary tree traversal of the method for solving the problem

四色算法代码，已经在OMNETPP平台上编译成功！-Algorithm for four-color code has been compiled successfully OMNETPP platform!

实现了关键路径算法。 给定一些点，并给定点间的路径的权值，求两点间的最短路径-achieve a critical path algorithm. Given some point and fixed-point to the right path of duty between 2:00 seek the shortest path

通过客户端IP转向指定的城市页面 数据库含23万条数据，删除了所有国外的IP地址，查询不到的IP都被转到“北京” -Client IP through the city towards the designated page database containing 230,000 data, delete all foreign IP addresses, inquiries have been less than the IP to the

A template solution for C++ database development Description: A template class that can write,read,modify & delete objects of any class/structure to a database.

这是将中缀表达式转换为后缀表达式的代码。中缀到后缀转换使用堆栈。各种使用的函数包括基本堆栈操作，如overflow（）、int underflow（）、void push（）、int pop（）、int peep（）、void display（）等。

&《实验数据结构》第一册教材（1）上网程序。雷亚尔

数据库系统概论（第三版） pdf格式图书 萨师煊著-Introduction to Database Systems (third edition) pdf format book with Savimbi division Xuan