-
CRC checksum algorithm code is given 16, 32, etc. CRC algorithm and a detailed d...
给出了CRC校验和算法代码16、32等CRC算法并进行了详细说明
- 2023-01-20 02:10:04下载
- 积分：1
-
MHP application testing tools, the most famous free MHP Simulator
MHP 应用测试工具，最有名的免费MHP模拟器-MHP application testing tools, the most famous free MHP Simulator
- 2022-08-11 21:04:06下载
- 积分：1
-
dotnet FTP源
dotnet ftp source
- 2022-03-26 09:41:25下载
- 积分：1
-
操作键盘和鼠标宏记录器
键盘和鼠标操作宏记录器-operated keyboard and mouse macro recorder
- 2023-08-03 08:55:02下载
- 积分：1
-
模仿windows下记事本的功能，并增加了字体和颜色
模仿windows下记事本的功能，并增加了字体和颜色-Notepad windows mimic the function of the next, and to increase the font and color
- 2022-01-24 18:51:26下载
- 积分：1
-
This is a time in my own study of small programs still feel quite up to the peop...
这是一个我在学习时自己做的小程序感觉还是比较行的大家过来帮我提一些意见吧-This is a time in my own study of small programs still feel quite up to the people to help me make some views on this
- 2022-08-24 23:38:14下载
- 积分：1
-
Windows环境下32位汇编语言程序设计,十分全面
Windows环境下32位汇编语言程序设计,十分全面-Windows Environment 32-bit assembly language programming, a very comprehensive
- 2022-11-03 12:05:03下载
- 积分：1
-
DOOM源代码 DOOM源代码
DOOM源代码 DOOM源代码-DOOM source code of DOOM source code of DOOM source code
- 2023-03-30 19:00: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
-
线形选择算法_算法分析.
线形选择算法_算法分析.-linear algorithm _ algorithm analysis.
- 2023-05-11 09:40:03下载
- 积分：1
