-
用C语言编写时分秒计数器,能够计时到23小时59分59秒
用C语言编写时分秒计数器,能够计时到23小时59分59秒-realize an arithmometer by using C programming
- 2023-04-30 05:55:03下载
- 积分:1
-
读取MDL模型数据,很详细,可以简单修改就可以完成3D模型动画...
读取MDL模型数据,很详细,可以简单修改就可以完成3D模型动画-MDL model data to read, very detailed and simple modifications can be completed on the 3D model animation
- 2022-07-22 11:59:28下载
- 积分:1
-
Fortran程序增加材料,不错,值得参考
Fortran程序增加材料,不错,值得参考-Fortran
- 2022-01-25 16:55:45下载
- 积分:1
-
I wrote an integrator, when the competition could have been written to the schoo...
我写一个积分器,比赛时候用的,本来是给学校写的,结果他们没用,郁闷吧-I wrote an integrator, when the competition could have been written to the school, their useless, it depressed
- 2023-06-23 13:35:04下载
- 积分:1
-
This code describes how to create instance from object in the run time in c#
This code describes how to create instance from object in the run time in c#
- 2023-07-14 21:05:02下载
- 积分:1
-
一个用在手机上的实时语音采集类封装(包含使用说明)
一个用在手机上的实时语音采集类封装(包含使用说明)-One used in real-time voice on the phone Packaging Acquisition category (including the use of explanation)
- 2022-01-24 17:31:28下载
- 积分:1
-
在VC,MFC中显示图像,如GIF,JPEG等格式
在VC,MFC中显示图像,如GIF,JPEG等格式-in VC, MFC showed images such as GIF, JPEG format, etc.
- 2022-07-13 00:45:24下载
- 积分: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
-
二维码生成
在VS2010平台上实现实时对字符串的二维码转换,亲测可用
- 2022-02-15 17:59:17下载
- 积分:1
-
2410开发必备,格式化nandflash,下载bin到nandflash。
2410开发必备,格式化nandflash,下载bin到nandflash。-2410 development required, formatting nandflash. nandflash to download bin.
- 2022-04-09 07:00:24下载
- 积分:1