vfp原程序prg

C语言课程设计，数据结构CAI系统，C语言课程设计，数据结构CAI系统-C language curriculum design, data structure CAI System，C language curriculum design, data structure CAI System，

class pour activation des formes géométriques triangulaires et rectangulaires

一个数据结构的演示程序,包含顺序表,广义表,顺序查找等-A data structure of the demo program, including the order form, the generalized form, the order of search, etc.

(一) 编写一个程序LAGO7-1.CPP，实现二叉树的各种运算，并在此基础上设计一个主程序完成如下功能。 （1） 输出二叉树B； （2） 输出二叉树B的深度； （3） 输出H结点的左、右孩子结点值； （4） 输出二叉树B的宽度； （5） 输出二叉树B的结点个数； 输出二叉树B的叶子结点个数 -(A) to prepare a program LAGO7-1.CPP, to achieve a variety of binary operations, and on this basis, design a main program performs the following functions. (1) output binary tree B (2) The output of a binary tree B of depth (3) The output of H nodes left and right child node value (4) outputs a binary tree B, width (5) output node B, the number of binary trees (6) outputs a binary tree B, the number of leaf nodes

对vb登录界面的设计,是一个比较好的界面设计-right vb login interface design is a good interface design

将excel格式的文件销售订单导入数据库中-Will excel file sales orders into the database

一个用来储存资料的数据库用C++builder 与jet 4.0编写-used to store a database with information on the C jet builder with 4.0 preparation

已知一个二叉树的前序与中序，输出其后序的程序。-known to a sequence of binary tree with the order, then the order of the output process.

一个快速排序算法的实现例子，数据结构课程作业，可作研究学习之用。 包含源文件和详细的开发文档，可方便移植到C等语言平台。-a fast algorithm to achieve example, the data structure course work and can be used for research and study purposes. Includes source document and detailed documentation, will facilitate the transplantation of languages such as C platform.

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.