数据预测算法，主要是一元n次方程的回归预测实现。* 预测分析...

一 开发环境 OS: Windows 2000 Server + SP2 IDE: Visual Studio 6.0 + SP5 DataBase: SQL 2000 Server + SP2 二 运行 1：创建数据库 将TRADE.sql中的SQL语句考入SQL Server的查询分析器中，全部运行； 2：建立ODBC数据源 数据原名称为Trade_MIS-A development environment OS: Windows 2000 Server+ SP2 IDE: Visual Studio 6.0+ SP5 DataBase: SQL 2000 Server+ SP2 Second run 1: create a database of SQL statements TRADE.sql admitted to the SQL Server" s Query Analyzer, all running 2: Create ODBC data source data formerly known as Trade_MIS

一个管理系统全部-a management system for all

一个操作Sql Server 2000数据库的工具,支持远程（局域网）操作 主要功能就是远程（局域网）操作Sql Server数据库 包括： 搜索并列举局域网内的所有Sql Server服务器 搜索并列举Sql Server服务器中的所有数据库 搜索并列举数据库中的所有表 对数据库结构的简单更改 对数据库表记录的查找、编辑等等。

用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.

The crystallize of the initial study, one class examination system of calculator, everyone gives order to point out.-The crystallize of the initial study, one class examination system of calculator. everyone gives order to point out.

两列双向链表相同值查询设计： 实现内容：构建两个双向链表，能够根据第一个链表中的值查询在第二个链表中的相同值的位置-2 bi-directional value chain the same query design: the realization of content: To construct two two-way linked list, according to the first list of values query in the second list value in the same position

实现各种内部排序。包括冒泡排序，直接插入排序，Shell排序，快速排序，堆排序，并比较排序的比较次数和移动次数。主要是C语言。-achieve internal order. Including bubble sort, direct insertion sort, Shell sort, quick sort, heap sort, and compare the ranking of number and mobile number. C is the main language.

本程序是实现对室内电源线及插座的布局 是数据结构中的一个程序-this procedure is right indoor power lines and the socket layout data structure which is a procedure for the

哈夫曼算法的源程序，根据清华大学数据结构一书中的算法编写-Huffman algorithm source code, according to a data structure of Qinghua University"s book algorithm

Delphi编程练习：在数据库中以文件流形式保存JPEG图片。-Delphi Programming practice: in the database in order to document the form of preservation of JPEG image stream.