实验数据结构，第一个教科书（1）互联网接入…

八皇后问题，回溯算法的经典例子，此程序可以扩展至n皇后问题。-eight Queen"s problems, backtracking algorithms classic example of this procedure can be extended to n Queen"s problem.

二叉树系数计算[DeV-C++学习]，利用动态规划动态编程计算

数据库实验，建立一个简单的数据库，有打开、存储、删除、建立等值嵌套循环连接的功能。-database experiments, a simple database, open storage, delete, equivalent to establish nested loop join function.

第六章 模板与数据结构习题 6.2.1 需要编写一个对多维数组通用的算法（即各维的大小未定），怎样才能把实参多维数组的信息全部传递到函数中去？-Chapter VI with the data structure template 6.2.1 Exercises need to write a generic algorithm for multi-dimensional array (that is, the size of the peacekeeping undetermined), how can the real multi-dimensional array parameter information passed to the function all go?

使用两个向量的叉积来判断两条线段是否相交-The use of the cross product of two vectors to determine whether two line segments intersect

二叉树应用-线索化二叉树遍历的源码以及实验报告！-Binary Tree Application- threaded binary tree traversal of the source and the experimental report!

广义表的反序 逆置广义表的递归模型如下： F(LS) = null 　　　　　　　　　　　　　若 LS 为空 F(LS) = LS 　　　　　　　　　　　　　若 LS 为原子，且 tail(LS) 为空 F(LS) = append( F(tail(LS)), head(LS) ) 　若 LS->tag=0 ，且 LS->tp!=null F(LS) = append( F(tail(LS), F(head(LS)) ) 　若 LS->tag=1 其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.

教材管理系统

ISAM系统实现，含有BTREE源码，等-ISAM system containing BTREE source, such as

一个很好的VC源代码，值得借鉴-a good VC source code, worth learning