-
线性表 约瑟夫环
线性表 约瑟夫环-Josephus Linear List
- 2022-07-16 04:53:57下载
- 积分：1
-
Rota, but also mobile, can clearly see that the entire process
-罗塔，而且移动，可以清楚地看到整个过程
- 2022-03-02 16:40:11下载
- 积分：1
-
中文Access 2000 24学时教程(PDG)
中文Access 2000 24学时教程(PDG)-Chinese Access Guide 2000 24 school (PDG)
- 2022-01-25 15:56:56下载
- 积分：1
-
数据结构里的dfs算法，包括递归与非递归。用vc6.0编写
数据结构里的dfs算法，包括递归与非递归。用vc6.0编写-data structure, the dfs algorithms, including recursive and non- recursive. Prepared with vc6.0
- 2022-01-21 23:50:04下载
- 积分：1
-
ADO 封装好的数据库操作类 ，直接可以使用标准接口
ADO 封装好的数据库操作类 ，直接可以使用标准接口-ADO packaged good category database operations directly can use the standard interface
- 2022-04-25 16:28:45下载
- 积分：1
-
MiniDatabase
实现自己的数据库管理程序。
可以在输入端里写入SQL语句， 那么我的程序就可以帮你把刚才的语句实现， 然后反应在我的数据库中， 我的数据库的话， 都是我自己管理存储方式， 表属性存储， 等等。要表扬的是我自己利用了缓冲区技术， 当然比正规的MySQL， SQL Server程序差得很多， 但是我自己模仿的它们的内部结构。
用VC++。
谢谢， 大家的欣赏。
- 2022-05-30 00:34:03下载
- 积分：1
-
根据事务文件成批地更改主文件并得到一个新的主文件，与吴伟民数据结构课本完全一致，用C实现...
根据事务文件成批地更改主文件并得到一个新的主文件，与吴伟民数据结构课本完全一致，用C实现-Affairs bulk to change the primary document to be a new master file, and data structure Xiulan WU Weimin textbooks entirely consistent with achieving C
- 2022-03-11 16:47:38下载
- 积分：1
-
图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂
图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂-Graph Theory in the bipartite graph matching the best match for KM algorithm, with c realize, easy-to-read
- 2022-09-24 04:50:02下载
- 积分：1
-
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
迷宫算法（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.
- 2022-08-08 06:28:42下载
- 积分：1
-
University Games management system, by reading the registry parameters to automa...
高校运动会管理系统，通过读取注册表自动配置数据库服务器参数，数据库采用SQL server2-University Games management system, by reading the registry parameters to automatically configure the database server, database using SQL server2000
- 2023-01-23 14:55:04下载
- 积分：1
