-
suoxiangshi jiajiancheng
多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂-suoxiangshi jiajiancheng
- 2022-01-27 15:17:49下载
- 积分:1
-
航空信息管理系统
航空信息管理系统-Aviation Information Management System
- 2022-04-07 08:09:51下载
- 积分:1
-
一个不错的数据源连接程序
一个不错的数据源连接程序-a good source of data link procedures
- 2022-04-18 16:55:21下载
- 积分:1
-
maze solving algorithms, data structures can be used for teaching
迷宫求解的算法,可用于数据结构的教学-maze solving algorithms, data structures can be used for teaching
- 2023-03-07 06:10:03下载
- 积分:1
-
一个经典的数据结构的实现
一个经典的数据结构的实现-a classic of the data structure to achieve
- 2023-04-13 21:25:03下载
- 积分:1
-
改良的新型遗传算法,增加了父代与子代的杂交,适合特殊问题求解。...
改良的新型遗传算法,增加了父代与子代的杂交,适合特殊问题求解。-New improved genetic algorithm, an increase of parent and offspring of the hybrids, suitable for specific problem-solving.
- 2022-02-22 05:59:01下载
- 积分:1
-
本设计完成了要求的所有功能,可由系统建立一张图或者由用户自行建立一张图,并对该图进行关键路径的搜寻.用户界面友好,有用户使用说明,每一步操作都有说明与提示。程序...
本设计完成了要求的所有功能,可由系统建立一张图或者由用户自行建立一张图,并对该图进行关键路径的搜寻.用户界面友好,有用户使用说明,每一步操作都有说明与提示。程序运行通过,有详细的解释说明。-the design completed all the required functions, from the establishment of a system or plan established by the users themselves a map, and this map critical path of the search. User friendly interface, users note, every step of the operation have notes and hints. Running through a detailed explanation.
- 2022-04-28 23:49:48下载
- 积分:1
-
一个表达式求值程序 ACM常用
一个表达式求值程序 ACM常用-evaluates an expression commonly used procedures ACM
- 2022-08-17 16:33:05下载
- 积分:1
-
代码茂 LCD4bit.c
空 LCD_Enable(void)
{
output_high(LCD_EN) ;
delay_us(100) ;
output_low(LCD_EN) ;
delay_us(500) ;
}
//Ham Gui 4 位杜代替 Ra 液晶屏
无效 LCD_Send4Bit (无符号字符型数据)
{
output_bit (LCD_D4,数据与 0x01) ;
output_bit (LCD_D5,数据 & 0x02) ;
output_bit (LCD_D6,数据 & 0x04) ;
output_bit (LCD_D7,数据 & 0x08) ;
/ /
- 2023-08-23 22:00:03下载
- 积分: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