VB MATRIX SOL

DAO操作Access数据库类，提供测试程序-Access Database DAO type operation, procedures for testing

一个简单适用的产品订购系统，适合初学者使用-A simple application of the product ordering system, suitable for beginners to use

红黑树数据结构的c实现-RED-BLACK TREE data structure to achieve the c

创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose is to solve the problem of traditional values, the importation of the @ symbol, said the end of a tree-binary tree of clues to find the current node"s successor nodes, for the current node precursor nodes, China preorder

科研管理系统是用PoerBuilder编写-research management system is used to prepare PoerBuilder

如何以编程方式将数据从ACCESS数据库导出到EXCEL

数据库的一点点小常试 转别人的希望哪个有收获 谢谢大家哦-The database a little bit of small regular test to others which have a harvest of hope Oh I would like to thank everyone

算符优先函数 设计一个给定算符优先分析表，用有向图法构造算符优先函数的算法。-Operator to design a priority function given priority operator analysis table, and have to graph structure function operator priority algorithms.

一个简单的数据库作业，学生学籍管理系统，使用SQL编写。程序里面包括查询表结构，查询结构，学生学籍管理等一系列结构，并通过C语言编程，编程出了登陆界面。

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