数据库查询示例程序 　数据库查询示例程序 　

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

用数据结构实现基本算法 用C++实现车务管理，需用到栈基本数据结构-data structure used to achieve basic algorithm to achieve C bus services management, needed to stack the basic data structure

十进制数与二进制数的互相转换　编程练习-decimal number and the number of binary interchangeable programming exercises

欢迎到分钟报警 VB6 实用程序，用于...时间在几分钟内在第一个文本框中输入。

控件datagridSource-Control datagridSource

最小生成树的贪心算法实现 普里姆算法 用邻接矩阵进行图的生成-the minimum spanning tree algorithm Primbetov greedy algorithm adjacent matrix chart generation

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

1.本程序由本人采用vc++ 6.0编写，包括了排序平衡二叉树的整套算法（包括插入、删除、查找以及其测试算法）。 2.运行myavl_vc.exe输入树的初始结点个数，确定后本程序将在内存中生成一棵相应结点数的二叉树，在此基础上你可以进行各种操作（插入、删除、查找以及测试其平衡性、排序性等） 3.每一个结点信息包括"商品编码"、"商品名称",且以"商品编码"作为关键字 4.初始生成的树的结点的商品编码为从1按顺序递增，商品名称为"生成的商品"加上商品编码 5.程序中的随机插入与随机删除是为了更好的测试程序的正确性和可靠性 6.随机插入（删除）时，程序将不断向（从）树中随机插入（删除）结点，每次随机插入（删除）都会进行平衡性与排序性的检查，如果树已经失去了有序性或平衡性，则会弹出树已失去了有序性或平衡性的提示并停止插入（删除）操作，当然你可以随时中断随机操作-1. The procedure I used vc 6.0 preparation, including the sequencing of the entire balanced binary tree algorithm (including insert, delete, search and test algorithm). 2. Running myavl_vc.exe importation of the initial tree node number, the procedures established in the memory of the formation of a corresponding nodes of a binary tree, and on this basis you can conduct various operations (insert, delete, search and testing their balance, sorting etc.) 3. each node information including "Product Codes," "trade names," and the "commodity codes" as the keyword 4. initial produ

迷宫算法（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.

这个是数据结构中一定有的哈夫曼的实验-this is the data structure will have to Huffman experiments