-
com组件程序设计原程序
com组件程序设计原程序-com components original program design procedures
- 2022-02-02 22:28:15下载
- 积分：1
-
自己编写的很多源代码，很适用，需要的来下,非常辛苦地编写的代码...
自己编写的很多源代码，很适用，需要的来下,非常辛苦地编写的代码-Many have written the source code, it is applicable, needed to, it is very hard to write code
- 2023-03-10 16:00:04下载
- 积分：1
-
this zlg7289 chips for the first documentation procedures, including 51 this mic...
此为zlg7289芯片的头文件程序，包括51单片机对此芯片的控制函数-this zlg7289 chips for the first documentation procedures, including 51 this microcontroller chip control functions, etc.
- 2022-05-30 15:46:54下载
- 积分：1
-
this best way to see how is this or that on this
this best way to see how is this or that on this-this is best way to see how is this or that on this
- 2022-06-21 22:39:29下载
- 积分：1
-
1500个WINDOWSAPI类源代码
1500个WINDOWSAPI类源代码-1500 WINDOWSAPI source category
- 2022-05-05 19:03:25下载
- 积分：1
-
个人考勤软件开发示例，很简单的
个人考勤软件开发示例，很简单的-personal attendance software development paradigm, a very simple
- 2022-08-05 13:45:20下载
- 积分：1
-
高内存分配
Memory Allocation for High-Dimensional Data Structures
- 2023-05-05 12:05:04下载
- 积分：1
-
以深度为k的满二叉树(n=2k
以深度为k的满二叉树(n=2k-1)为例，假设表中每个记录的查找概率相等，即 pi=1/n（1≤i≤n），而树的第i层上有2i-1个结点，因此，折半查找的平均查找长度为：
所以，折半查找的平均时间复杂度为O(log2n)。
-To a depth of k over the binary tree (n = 2k-1) as an example, suppose the table to find the probability of each record the same, that is, pi = 1/n (1 ≤ i ≤ n), and the tree layer of the first i There are 2i-1 nodes, therefore, to find half the average length of search as follows: Therefore, to find half the average time complexity is O (log2n).
- 2023-08-09 03:30:03下载
- 积分：1
-
demonstration of how the dialog box to view the methods used vc 6.0.
演示了如何在对话框中加入视图的方法,采用vc++6.0.-demonstration of how the dialog box to view the methods used vc 6.0.
- 2022-01-25 16:44:26下载
- 积分：1
-
软件架构设计，流程架构设计，组织架构设计
软件架构设计，流程架构设计，组织架构设计-Software architecture design, architecture design flow, organization structure design
- 2023-03-27 05:40:02下载
- 积分：1
