-
数据结构示例。适用于对数据结构有一定基础的人研究练习
数据结构示例。适用于对数据结构有一定基础的人研究练习-Examples of data structure. Data structure suitable for a certain practice-based studies
- 2022-01-25 17:15:49下载
- 积分：1
-
The zip file contais a sample program to check the sybase database connectivity....
The zip file contais a sample program to check the sybase database connectivity. I ve attached the makefile as well for compilation on windows.
Usage :
test_conn
- 2023-03-12 16:00:03下载
- 积分：1
-
数据结构课程设计 AVL树等 希望对大家有帮助
数据结构课程设计 AVL树等 希望对大家有帮助-AVL tree data structure, such as curriculum design, we want to help
- 2022-07-20 14:19:42下载
- 积分：1
-
PB制作考试系统
PB制作考试系统-PB production test system
- 2023-01-28 21:00:04下载
- 积分：1
-
DAO Database Programming connect to the database
数据库编程 DAO连接数据库-DAO Database Programming connect to the database
- 2023-02-24 02:35:03下载
- 积分：1
-
严蔚敏编写的《数据结构》第6章的答案，全部为源码
严蔚敏编写的《数据结构》第6章的答案，全部为源码-the answers of chapter 6 of a book called ‘Data Structures’ writen by Yan Wei Min
- 2022-10-03 12:50:03下载
- 积分：1
-
ADO use and Packaging example, a very practical
ADO使用和封装的例子，很实用-ADO use and Packaging example, a very practical
- 2022-04-21 04:01:12下载
- 积分：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
-
2元树的先根遍历算法，中根遍历算法，后根遍历算法
2元树的先根遍历算法，中根遍历算法，后根遍历算法-2 yuan tree traversal algorithm first root, root traversal algorithm, after the root traversal algorithm
- 2022-03-10 21:42:59下载
- 积分：1
-
随着市场经济的快速发展，国内医药企业…
随着市场经济的迅猛发展，国内医药企业的竞争也日趋激烈。企业内部的信息管理急需信息化。针对鑫诚药业有限公司的业务情况和企业发展的要求，设计并建立该公司的医药基础信息管理系统。解决企业对于药品信息、员工信息、客户信息以及供应商信息的管理问题。通过该系统，可以快速的获取有关药品、员工、客户及供应商的基础信息。-With the rapid development of market economy, the domestic pharmaceutical enterprises and competition is increasingly fierce. Enterprise information management in urgent need of information technology. Cheng Xin Pharmaceutical Co., Ltd. for the business situation and business requirements of the development, design and build the basis of the company
- 2022-03-10 04:31:35下载
- 积分：1
