翻译XML数据库

栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式，它对于数据的存放和操作有下面这样的特点： 1) 它只有一个对数据进行存入和取出的端口； 2) 后进者先出，即最后被存入的数据将首先被取出。其形式很象一种存储硬币的小容器，每次只可以从顶端压入一个硬币，而取出也只可以从顶端进行，即后进先出。 这样的数据存储和管理形式在一些程序设计中很有用。例如，编译系统中(这是一类比较复杂的程序)，对于函数调用的处理、对于表达式计算的处理，都利用了栈这样的数据结构。- The stack (stack) is in the programming process frequently meets the vitality one kind of construction of data form under, it has such characteristic regarding data depositing and the operation: 1) it only has a logarithm according to the port which carries on stores and takes out; 2) less advanced first leaves, namely finally the data which will store first is taken out. Its form looks like one kind of memory coin very much the small container, each time only may press in a coin from the peak, but takes out also only may carry on from the peak, namely less advanced first leaves. Such data storage and the management form are very useful in some programmings. For example, in the compiling system (this is a kind of quite complex procedure), transfe

如何分离一个顺序表里的0元素和非0元素？本程序展示了三种高效算法并比较他们之间的性能-How to separate 0 and non-0 element in a squencial list? The program shows three effective algorithm and compare their performances.

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

模糊查询源码,实现简单的数据库条目查找。

数据结构的java实现-data structure to achieve the java

这是关于古代9连环问题的求解过程，包括安装跟坼卸-This is a chain of nine ancient problem solving process, including the installation of crack with dumping

vb实现最短路径Dijkstra算法，很经典的算法。-vb realize Dijkstra shortest path algorithm, it is the classic algorithms.

编译原理中在自下而上分析和优先分析方法中使用的Washall算法-Compilation Principle of priority in the bottom-up analysis and analytical methods used in Washall algorithm

基于SQL Server数据库和JAVA语言的学生信息管理系统；完整源代码，JAVA语言实现，NetBeans开发环境，可以导入Eclipse

数据结构迷宫求解：用非递归方法求迷宫路径-Data structure to solve the maze: a maze with non-recursive method, to calculate the path