几种数据结构算法的C程序实现

用短小的c语言编出了精湛的通讯簿，值得一看 包含了插入 删除 排序等一系列操作。-notebook

vfp表单，设置操作员的权限。（压缩文件）-Probe form, a set of operator competence. (Compressed files)

图书馆管理系统簿，借款人的详细信息，还会生成罚款支出。 对借款人分配固定的数量的书。 此外将删除、 修改或更新的书详细信息和借款人的书 此外添加了新的书籍、 新的借款人，和删除相同

数据库查询、显示程序，使用access数据库，需要配置数据库程序才能使用-database query, display, the use of database access, the need for database programs can use

数据结构算法，稀疏矩阵的存储，两矩阵相乘，两矩阵相加的实现-data structure algorithms, sparse matrix storage, two matrix multiplication, the sum of two matrix to achieve

细胞生长的源码，使用VC描述，适合研究数据结构-Cell growth source, the use of VC descriptions, research data structure suitable for

自动从数据库按类导出文本，读取ACCESS，根据文本类别 读出文本-Automatically derived from the database by category text, read ACCESS, according to the text read out the text of the categories

vb源代码完全数据库控制-vb source database completely control

图的表示 数据结构-map indicates that the data structure

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