pao madengsd sdf sdfdfs dfsdf

数据库使用的各种语法，详细的介绍了数据库的使用-Database used in a variety of grammar and detailed introduction of the use of the database

对给定书的总页码，计算出书的全部页码中分别用到多少次数字0，1，2，3...9.-DataStatistics

求两个字符串的最长公共子序列，使用递归算法实现。-For two of the longest common sub-string sequences, using the recursive algorithm.

编写我们自己的miniSQL代码，几周前没有调试

考勤管理系统的开发目的是电脑的传统方式平时都出席。为开发这一软件的另一个目的是生成自动在末尾的会话或在报告之间的会话

数据库监视备份软件te:应用程序例子(te.exe)-Bowl beat pacing视tong-de-sac glass figurines 软 te: Beckmannia email using the most序bird

将数据从文本文件中按照规定格式装入INFORMIX数据库中，再从数据库中转出为文本文件并同时剔出相同号码-data from the text file format required load INFORMIX database and then transferred from the database to a text file and to get rid of the same number

VC编写的读取数据文件的源码-VC compilation reads the fetching according to the document source code

ADOClient通过ADO调用后台数据库，支持ORACLE，MSSQL，ACCESS等数据库-ADOClient

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)