2 ADT3 a. b. c. d. e. f. g. Gvwh. Gvi. Gvj. Gk. Gl. m.

vb用sql语句操作数据库-vb used to operate the database sql statement

输入一个式子，判断式子中的括号是否配对成功-importation of a formula, the formula to judge whether the matching brackets success

折半查找算法,实现对于一组数据的查找操作,利用折半查找法进行查找-binary search algorithm, to achieve a set of data for the search operation, the use of binary search method you

中后序列求二叉树，c语言，源码有注释，可供学习使用。-posterior sequence for Binary Tree, c language, a source notes for studying.

关于教学管理的数据库-on teaching management database

任意阶一次幻方生成器 < 常用算法与数据结构 >-arbitrary order a magic square generator lt; Common algorithms and data structures gt;

数据结构课程实验中所编的判断哈夫曼编码.参考可用-experimental data structure courses, which include the judgment Huffman coding. Reference available

动态加载odbc数据源及其内部表单的小程序-Dynamic loading odbc data source and its internal form of small programs

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

演示一个寻找最短路径的算法。-find a demonstration of the shortest path algorithm.