FastDb是高效的内存数据库系统，具备实时能力及便利的C++接口。FastDB不支持client...

VC++下的不规则三角网生成算法,这是不规则三角网的生长算法,通过建立TIN类,在TIN类内实现一些方法.-VC under the TIN generation algorithm, which is triangular irregular network growth algorithm, through the establishment of TIN category, the category TIN achieve some ways.

VB为前台，SQL_SERVER为后台的关于贸易的数据库编程-prospects for VB, SQL_SERVER background on the trade of Database Programming

类的处理，异常处理，超载的编码，REM AddNewStudent.sql REM Chapter 9, Oracle9i PL/SQL Programming by Scott Urman-Class processing, exception handling, overloading the encoding, REM AddNewStudent.sql REM Chapter 9, Oracle9i PL/SQL Programming by Scott Urman

Informix SQL教程指南 V9.4，Informix中如何使用SQL-Informix SQL Tutorial Guide V9.4, Informix in how to use SQL

C语言写的Hash算法，在各种平台上都编译通过，可以直接使用。-C language to write the Hash algorithms on various platforms are compiled, can be used directly.

3X3填质数问题，在一个3×3的矩阵中填写1－10的数字，保证上下左右相加都是质数-3X3 fill several quality problems in a 3 3 matrix to fill in the figures 1-10, ensuring that all about is the sum of the number of quality

这是利用数据结构只是写的一个宾馆客房管理小程序，可以完成基本的管理程序的功能，包括输入输出信息，输入修改记录等。-This is the use of the data structure is written in a hotel room management of small programs that can perform basic functions of management process, including the input-output information, input modify the records.

该程序用于计算二项式系数，它采用动态规划的方法，其效率远远高于递归的方法，而且空间效率也很高。-the procedures used to calculate the binomial coefficients, which uses dynamic programming methods, the efficiency is far higher than the recursive method and space efficiency is also high.

1.数据库文件名：spkc(位置：商品库存管理系统源程序文件spkc.mdb) 2.数据库类型：Access 3.连接方式：ADO 4.用户名：mrkj 5.密码：111dataspxxglxt_Log.LDF文件) 2.数据库类型：SQL Server 3.连接方式：ADO 4.用户名：mrkj 5.密码：-1. Database File Name : spkc (location : merchandise inventory management system source files spkc.mdb) 2. Database types : Access 3. Connectors : ADO 4. Username : mrkj 5. Password : 111 data spxxglxt_Log.LDF) 2. Database types : SQL Server 3. Connectors : ADO 4. Username : mrkj 5. Password :

该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it"s time complexity of O (n), but this sort known to be applicable to sort out the range, and if the upper and lower limits of the relatively large margin, space consumption is relatively large.