-
Knapsack problem, knapsack problem of the five kinds of algorithms, a total of f...
背包问题,背包问题的5种算法,一共五个文件,每个文件一种算法-Knapsack problem, knapsack problem of the five kinds of algorithms, a total of five files, each file an algorithm
- 2022-03-19 19:46:41下载
- 积分:1
-
WPF 窗口 RawInput
原始输入窗口中的开发的 Visual Studio 2010 感谢手表 ^^
- 2022-12-09 11:10:03下载
- 积分:1
-
称重系统的上位机监控程序,通过MODBUS通讯协议实现.
称重系统的上位机监控程序,通过MODBUS通讯协议实现.-Weighing the Host Computer System Monitoring Program, MODBUS communications protocol.
- 2022-07-02 01:47:12下载
- 积分:1
-
asp前台 access后台 图书馆管理系统毕业论文毕业设计全套
asp前台 access后台 图书馆管理系统毕业论文毕业设计全套-asp future library management system access background design a full set of graduation thesis
- 2023-01-17 15:40:03下载
- 积分:1
-
计算机视觉中的SSD算法源代码
SSD algorithm in computer vision source code
- 2022-04-09 23:32:50下载
- 积分:1
-
With C++ Prepared HMM model, MFC framework, the source code of the resource shar...
用C++编写的HMM模型,MFC架构的,源代码部分,资源共享-With C++ Prepared HMM model, MFC framework, the source code of the resource sharing
- 2023-04-15 10:00:02下载
- 积分: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
-
will print the font format conversion to indicate font formats
将24点阵打印格式的字库转换为显示格式的字库-will print the font format conversion to indicate font formats
- 2022-03-06 03:04:59下载
- 积分:1
-
neural net program and software
neural net program and software
- 2022-01-24 15:40:53下载
- 积分:1
-
基于VC++ 6.0 MFC 的网络通信聊天程序设计源代码
基于VC++ 6.0 MFC 的网络通信聊天程序设计源代码-Based on VC 6.0 MFC chat network communication programming source code
- 2022-01-26 05:17:42下载
- 积分:1