使用ADO的数据复制原型

根据先序和中序遍历的结果，重新构造二叉树-According to the results of the PreOrder and InOrder visit,rebuild the bitree

VC下实现响铃的小程序，自动生成一个小文件，可以用realplayer等播放器打开-VC under Neither the small program automatically generates a small file that can be used REALPLAYER other players open

以一个Maze(m, n)的长方阵表示迷宫, 迷宫的入口是Maze(1,1), 出口是Maze(m, n), Maze(i,j)等于0表示通路, Maze(i,j)等于1表示障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。各个命令以及相关数据的输入格式如下： 输入迷宫：C，接下来一行是m n，其中m是迷宫矩阵行数，n是迷宫矩阵列数，接下来的m行数据是迷宫矩阵，每行n个值，表示一个m*n的迷宫矩阵 求迷宫的一条通路：Q 当输入的命令为E时，程序结束-With a Maze (m, n), said the long square maze, the maze entrance is a Maze (1,1), exports is the Maze (m, n), Maze (i, j) is equal to 0, said channel, Maze (i, j) is equal to 1, said barrier. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no path. The various commands and data input format is as follows: Enter the Labyrinth: C, followed by his party mn, where m is the maze of matrix rows, n is a maze of matrix columns, the next line of data is a maze m matrix, each row n- value, indicating an m* n matrix of the labyrinth a maze of pathways: Q when the input command for the E, the end of the process

用module来定义数据类型-module used to define data types

通过面向对象的对象-关系映射持久化技术，将一对多以及多对多的数据保存到数据库中并提供查询修改等功能。-Through Object-Oriented Object- Relational Mapping Persistence technology, one-to-many and many-to-many data is saved to the database and to provide features such as query modification.

使用ODBC封装的CDatabase和CRecordset类- Uses CDatabase and CRecordset kind which ODBC seals

数据结构――动态规划算法-data structure-- Dynamic Programming

我做Excel报表，很老了Rksvr.ini文件文档在以下设置中，您必须更改实际的目录系统[syspath]=D:excelu sample1 temporary=D:excelu sample1与此相关的图片如下：点击查看文档忘记注意这是因为在vfp6下写入，所以选择对vfp8语句稍加改动，请自行修改

一个递归算法,并把递归出的文件隐藏,使用VB开发,希望大家支持-A recursive algorithm, and recursive documents are hidden, use the VB development, I hope you will support

改良的新型遗传算法，增加了父代与子代的杂交，适合特殊问题求解。-New improved genetic algorithm, an increase of parent and offspring of the hybrids, suitable for specific problem-solving.