一个短小精悍的PARADOX数据文件DB的修复工具，能修复绝大多数损坏的DB文件。...

完全采用指针编写的字符串排序程序，共两种方法，调试过-completely prepared by the string pointer ranking, with a total of two methods tuned

利用栈来完成数据结构实习的魔王语言.完成基本内容.-use to complete stack data structure attachment fiendish language. Completion of the basic content.

详细说明函数指针的用法，并形成函数指针数组调用方法

这是一本介绍面向对象数据库的书，对学习数据库的朋友们很有帮助。-This is an introduction of object-oriented database of books, to learning database helpful friends.

数据结构 之骑士周游算法-data structure Cavaliers travel Algorithm

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

C++软件设计开发 C++，进销存，access，开发，软件 C++，进销存，access，开发，软件 C++，进销存，access，开发，软件 C++，进销存，access，开发，软件C++，进销存，access，开发，软件C++，进销存，access，开发，软件

详细是描述了如何将一个数据集导出为Word文档，整个示例是个完整的程序，有相关的函数和调用说明，每个函数都有相关的注释，对于没有接触过此类开发的程序员应该说非常有用。非常欢迎大家下载。

给定正整数n，计算出n个元素的集合{1,2,?,n}可以划分为多少个不同的非空子集。 由文件input.txt提供输入数据。文件的第1 行是元素个数n。-Given positive integer n, to calculate a collection of n elements (1,2,?, N) can be divided into the number of different nonempty sets. By providing input data file input.txt. Document line 1 is the number of elements n.

插入运算符算法，123456789=a，在等式左边的任意两个数字之间插入 + - *使得等式成立，列出满足条件的所有结果-Insert operator algorithm, 123456789 = a, the left side of the equation inserted between any two figures+-* Make the equation set up, listing all of the results meet the conditions