Search - 2-3 tree

Search - 2-3 tree - List

[SCM] 51-practical-subroutine-(assembly) DL : 0: 第1章二进制定点数运算第2章二进制浮点数运算第3章十进制（BCD码）数运算第4章代码转换第5章数据变换第6章排序、查找和非线性算法第7章数学函数第8章树和图第9章延时与跳转控制第10章人机交互接口第11章单片机测控接口第12章 51单片机内部资源编程实例第13章单片机数据传输接口第14章波形发生与控制实例第15章 C51单片机软件抗干扰和数字滤波-Chapter 1 dot binary number operations Chapter 2 binary floating-point arithmetic Chapter 3 decimal (BCD) several operations Chapter 4 code conversion Chapter 5 data transform Chapter 6, sort and search and nonlinear algorithm Chapter 7 mathematical functions Chapter 8 and FIG tree Chapter 9 delay and jump control Chapter 10 human-computer interaction interface Chapter 11 microcontroller measure-control interface Chapter 12 51 SCM internal resources programming examples Chapter 13 single-chip microcomputer data transmission interface Chapter 14 waveform occurrence and control example Chapter 15 C51 software anti-interference and digital filter
Date : 2026-01-03 Size : 120kb User : 张志刚
[SCM] ok DL : 1: 圣诞树上，利用3个红外，检测周围人的活跃程度，树上的灯和音乐会随着人们活跃程度而改变不同的动作方式。-On the tree, the use of three infrared detection level of activity around them, the tree lights and concert level of activity as people change the way different actions.
Date : 2026-01-03 Size : 92kb User : krg
[SCM] Prim101 DL : 0: 这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the minimum spanning tree structure.
Date : 2026-01-03 Size : 5kb User : zhauona111