-
C++ Builder程序员学习数据结构第8章
C++ Builder程序员学习数据结构第8章-Builder programmers learn C data structures Chapter 8
- 2022-11-01 07:35:03下载
- 积分：1
-
Ｃ语言做的一个数据库的小程序，虽然小，但是可以帮助初学者学习怎样用Ｃ实现数据库编程...
Ｃ语言做的一个数据库的小程序，虽然小，但是可以帮助初学者学习怎样用Ｃ实现数据库编程-C language to a database of small programs, although small, but can help beginners learn how to use C Database Programming
- 2022-03-10 06:15:55下载
- 积分：1
-
客户管理
一个客户管理的源代码，采用三层式结构设计。-Management of a client
- 2023-08-18 08:20:03下载
- 积分：1
-
data structure c language teaching demonstration
数据结构c语言的演示教学-data structure c language teaching demonstration
- 2023-01-15 13:30:03下载
- 积分：1
-
this is a separate rule and the application of recursive the perfect embodiment...
这是一个分治法应用和递归的完美体现，它根据输入的数字在屏幕上打出美丽的图案。-this is a separate rule and the application of recursive the perfect embodiment of its import figures on the screen making beautiful designs.
- 2022-01-29 02:40:47下载
- 积分：1
-
eXtremeDB与# 39；的示例代码，对你有用！！
extremeDB s sample code,useful for you-extremeDB"s sample code, useful for you! !
- 2022-11-07 18:50:04下载
- 积分：1
-
队列解决杨辉三角
队列解决杨辉三角-Queue solve Pascal"s Triangle
- 2023-08-20 09:30:03下载
- 积分：1
-
数据结构课程设计,表达式求值.大家看看,如果功能不好再找我修改...
数据结构课程设计,表达式求值.大家看看,如果功能不好再找我修改-Data structure design, the expression is evaluated. Let us take a look, if not find my modified function
- 2022-06-01 20:21:32下载
- 积分：1
-
英语学习的软件说明
英语学习的软件说明-English learning software Note
- 2022-04-30 23:30:59下载
- 积分：1
-
清华大学类数据结构实现的乙
清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;
- 2022-01-21 19:44:41下载
- 积分：1
