数据结构的经典实现算法，对于学习数据结构的人很有帮助

数据结构课程设计，用C语言编写的约瑟夫环-data structure course design, preparation of the C language Josephus

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

使用ADO Reviewed版本1.1.0创建Access 2000数据库！

计算器是最有用和最使用装置的人几个世纪以来。即使在今天，它是一个重要的工具来执行复杂的计算涉及代数、 概率等。Visual basic 6.0 作为前端和任何后端可以为它。这将使学习者学会 vb 在更有效的方式。甚至连通性的各种前端与后端可以用轻微的修改完成。

开发过程中，总会遇到把一个数据表的行，以列的形式查询出来，这是一个动态的查询方法。以前总是容易忘记，发上来给新手看吧！这些命令多操作后就记住了， 

本人写的浙大acm题目的源码，贴出来供大家分享，希望对大家的编程水平能有所帮助-I wrote the title of the source Zheda acm, posted for everyone to share, in the hope that the level of U.S. programming, can be helped

TRegExpr is easy to use and powerfull tool for sophisticated search and substitutioning and for template-based text checking (especially usefull for user input validation in DBMS and web projects).

用pb写的日历控件,主要用的是外部的数据窗口,可以直接用在你的程序中.-pb write with the calendar controls, the external data window can be directly used in your procedures.

该软件模拟数据结构的算法实现-the software simulation data structure Algorithm

该源代码利用计算机模拟乘法竖式 计算阶乘 将每位数子保存在用new分配的一长字符数组里 在本人的机子上可计算30000!的精确值 用时近60秒-the source code used a computer simulation multiplication calculation factorial shaft will be preserved for each digit used in the distribution of a new long arrays of characters in my machine on computable 30,000! The precise value of time spent nearly 60 seconds