-
常用的C++数据结构算法,包括队列、堆栈、链表...等.以模板类型式实现...
常用的C++数据结构算法,包括队列、堆栈、链表...等.以模板类型式实现-C common data structure algorithms, including queue, stack, etc. List .... To achieve template-type
- 2022-02-06 04:20:33下载
- 积分：1
-
系统说明:这是一个应用数据库系统VFP开发的酒店管理系统.
系统说明:这是一个应用数据库系统VFP开发的酒店管理系统.-system Note : This application is a database system developed by VFP hotel management system.
- 2022-08-18 03:38:43下载
- 积分：1
-
循环双链表和算术表达式
如何插入、 删除和显示通告链接双重链接的列表。菜单驱动的程序与灵活的列表的大小。此外包括验证、 评价和中缀、 前缀和后缀表达式的转换。所有的代码写在 c 语言和签入 codeblocks。
- 2022-03-12 17:53:23下载
- 积分：1
-
调试顺序结构栈的基本操作(清华大学出版社数据结构C语言版书本P44)...
调试顺序结构栈的基本操作(清华大学出版社数据结构C语言版书本P44)-Debug stack order of the structure of the basic operations (Tsinghua University Press Data Structures C language version of the book P44)
- 2023-08-27 19:10:03下载
- 积分：1
-
常用的数据结构，高斯
数据结构中常用的Gauss-Seidel 迭代算法-commonly used data structures, the Gauss- Seidel iterative algorithm
- 2022-05-22 13:00:57下载
- 积分：1
-
a good staff training system
一个不错的员工培训系统-a good staff training system
- 2022-09-09 02:20:02下载
- 积分：1
-
实现了二叉排序树的所有功能
建立，增，删，改，查
实现了二叉排序树的所有功能
建立，增，删，改，查
-Achieved a binary sort tree all the features of the establishment, increase, delete, change, check
- 2022-01-26 08:04:17下载
- 积分：1
-
用友u860数据字典
内容在Access数据库中
用友u860数据字典
内容在Access数据库中
-UFIDA u860 data dictionary content in the Access database
- 2022-12-20 22:50:03下载
- 积分：1
-
这是一个经典的数据结构动态演示系统,支持C语言和pascal语言,对初学者肯定会有很大帮助...
这是一个经典的数据结构动态演示系统,支持C语言和pascal语言,对初学者肯定会有很大帮助-This is a classic demonstration of dynamic data structure, and C language support pascal language for beginners certainly be of much help
- 2022-02-07 16:28:42下载
- 积分：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
