-
报警程序比较简单,中午和下午提醒一点。
闹钟程序,比较简单,中午和下午各提醒一次,时间请有需要者自行在程序里改-alarm procedures are relatively simple, at noon and in the afternoon to remind a time please those who need to change the program
- 2022-02-06 05:25:46下载
- 积分:1
-
PoliceGIS
郑州市公安交通地理信息系统,非常全面,界面很漂亮。
- 2022-08-08 21:45:31下载
- 积分:1
-
演示vb6怎样读写纯文本的程序
演示vb6怎样读写纯文本的程序-demonstrate VB6 how to read and write plain text procedures
- 2022-02-06 05:05:12下载
- 积分:1
-
将一个十六进制的字符串转换成它的等价的十进制数值。主函数负责收集字符,并判别它们是否为十六进制字符,htoi函数负责转换工作...
将一个十六进制的字符串转换成它的等价的十进制数值。主函数负责收集字符,并判别它们是否为十六进制字符,htoi函数负责转换工作-to a hexadecimal string converted into its equivalent of the decimal value. The main function responsible for the collection of characters, and for judging whether the hexadecimal characters htoi function for conversion work
- 2022-02-01 10:44:30下载
- 积分:1
-
实现托盘程序的例子
实现托盘程序的例子-achieve pallet procedures example
- 2022-08-26 00:42:31下载
- 积分:1
-
Determine the background of an image, llowing extract foreground objects
Determine the background of an image, llowing extract foreground objects
- 2022-02-21 09:08:00下载
- 积分:1
-
步骤:。编译DLL:CL / LD f.cpp。查看出口:dumpbin /exports f.dll的…
steps: . compile dll: cl /LD f.cpp . view the exports: dumpbin /exports f.dll . compile exe: cl test.cpp . run: test
- 2022-03-24 08:35:04下载
- 积分:1
-
本程序是对经典的旅行商问题的一种解法,是学习数据结构算法的极佳材料,c语言编写...
本程序是对经典的旅行商问题的一种解法,是学习数据结构算法的极佳材料,c语言编写-the procedures of the classic traveling salesman problem a solution is learning algorithm data structure of excellent material, language c
- 2023-07-15 21:10:03下载
- 积分:1
-
Based on VC++, a variety of very good applies to multi
基于VC++,各种复选框很好的应用于多功能计算器-Based on VC++, a variety of very good applies to multi-box calculator
- 2022-03-21 18:27:05下载
- 积分: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