one for the good dao database development overseas.

这是一则无刷新发帖的实例，也是对Ajax的一个实际应用，后台是Apache+PHP,数据是文本(之所以考虑文本方便，数据库的话还要先安装，反而搞的复杂，所以采用文本。当然了，实际应用当中是采用MySql还是文本可以另选)-This is a refreshing post had no examples of Ajax is also a practical application, the background is a Apache+ PHP, the data is text (the text is having convenient, if the database should be installed, but are engaged in complicated, so use a text . Of course, the practical application of which is used MySql or text can elect)

约瑟夫环的数据结构算法 ＶＣ＋＋６．０实现-Josephus algorithm data structure VC++ 6.0

成绩分析系统 可分析学生几个学期以来的学习状况-performance analysis system can be analyzed several students since the semester learning

求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.

6个经典数据结构JAVA解法，供学习。-six classic data structures Java Solution for learning.

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output

数据结构编程源代码- Construction of data programming source code

取数据库内容到字符串，可用于显示-from database content to string can be used to show!

图书系统，包括图书的查询，添加，删除。用户信息的管理。-Circulation systems, including library queries, add, delete. User information management.

数据结构的课程设计，是实现二叉树的数据结构，包括文档。-Data structures course design is to achieve binary tree data structure, including the documentation.