proveeido文件系统

栈(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

各种排序算法，ＳＨＥＬＬ　ＭＥＲＧＥ，还有随机数的生成　-various sequencing algorithms, SHELL Merg, Random Number Generation

数据结构的课后练习-Data structure of the after-school practice

迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)

基于c-sharp和mysql服务器的小型医院管理

acad 公差查询源码, a2004,05,06, 可选择文本-Academy of tolerance inquiries source, a2004, the"06 option to text

用VB编写的医院挂号叫号系统，代码简介，功能强大，值得一看的VB医院叫号软件，

一个简单的公交查询管理系统，采用最短路算法，利用odbcapi函数访问数据库。-a simple inquiry transit management system, the most shorted algorithm, use odbcapi function access to the database.

生产者与消费者演示-producers and consumers demo

链表的基本操作，循环链表的一个应用实例，围桌问题的一个解决方法!-Chain basic operation, the recycling Chain an example, sat around the table in a solution!