-
检测液晶显示器的。请用turbo c2.0编译。
检测液晶显示器的。请用turbo c2.0编译。-detection LCD. Please use the turbo c2.0 compiler.
- 2022-07-04 21:40:34下载
- 积分:1
-
自已开的一个小的通讯录, 初学者的作品,,高手就不用看了 不好意思...
自已开的一个小的通讯录, 初学者的作品,,高手就不用看了 不好意思-own open a small correspondence, beginners work, and do not need to master reading sorry, as long as
- 2022-07-01 08:30:33下载
- 积分:1
-
ATL
基于ATL的ActiveX入门举例-ATL-based portal for the ActiveX
- 2023-03-25 06:55:03下载
- 积分:1
-
高质量C++编程指南,供编程爱好者使用,推荐
高质量C++编程指南,供编程爱好者使用,推荐-High-quality C++ Programming Guide for the use of programming enthusiasts, Recommended
- 2022-07-04 10:28:26下载
- 积分:1
-
大富翁棋牌类小游戏,函数编写,游戏编程中的经典例子
大富翁棋牌类小游戏,函数编写,游戏编程中的经典例子-Monopoly game chess classes, functions to prepare the game in the classic example of programming
- 2023-03-18 03:10:04下载
- 积分:1
-
家庭理财系统
javase的家庭理财系统的完整源码,可运行,具有一般功能,很实用,适合初学者,可以下载来学习借鉴。
- 2022-03-10 20:56:59下载
- 积分:1
-
遍历文件夹并建成目录树__遍历文件夹并建成目录树
遍历文件夹并建成目录树__遍历文件夹并建成目录树-traverse file folders and create directory tree
- 2022-08-21 11:39:26下载
- 积分: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
-
Weekday week program source code, the input/month/day, calculated the date of th...
Weekday星期计算程序源代码 输入年/月/日,计算得出该日的星期数 -Weekday week program source code, the input/month/day, calculated the date of the few weeks
- 2022-06-21 14:51:09下载
- 积分:1
-
diffrent event
diffrent event
- 2022-03-03 19:16:04下载
- 积分:1