-
android+SSH框架学习
android+SSH框架学习,里面有很多小项目,适合初学者学习
- 2022-02-21 07:55:41下载
- 积分:1
-
用单链表实现名片管理,本例还将数据结构与对话框,文档试图有机结合起来,希望能给读者以更多启发....
用单链表实现名片管理,本例还将数据结构与对话框,文档试图有机结合起来,希望能给读者以更多启发.-achieve card management, the cases will dialog with the data structure, the document attempts to combine the organic, hoping to give readers more enlightening.
- 2022-03-15 07:59:56下载
- 积分:1
-
石器时代客户端地图修改工具,这是官方专用的修改器,有了它可以自己做石器地图了!...
石器时代客户端地图修改工具,这是官方专用的修改器,有了它可以自己做石器地图了!-Stone Age tools for the client to amend the map, which is dedicated to amend the official, and has its own tools to do the map!
- 2023-01-04 14:30:03下载
- 积分:1
-
nmap不会不知道把
nmap不会不知道把-nmap does not know about
- 2022-09-19 19:45:03下载
- 积分:1
-
很多vc++的经典例程,vc++6中编译成功,实用性很强,有帮助!...
很多vc++的经典例程,vc++6中编译成功,实用性很强,有帮助!-vc++ many of the classic routines, vc++ 6.0 compiler successful, very practical, help!
- 2023-04-27 07:25:03下载
- 积分:1
-
Serial communications, the use of serial communication control realize.
串口通信,利用串口通信控件实现 。-Serial communications, the use of serial communication control realize.
- 2022-01-28 21:16: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
-
程序可以使用对话框
使用 visual c + + 6.0 和 windows 对话框的测试的程序。此程序使用菜单来访问对话框加载上编辑框的值。它还显示如何添加这些值。
- 2023-03-26 00:05:03下载
- 积分:1
-
一个面向WINDOWS调用的代码
一个面向WINDOWS调用的代码-WINDOWS calling for a code
- 2022-06-26 08:32:19下载
- 积分:1
-
扫雷MFC 扫雷MFC 扫雷MFC
扫雷MFC 扫雷MFC 扫雷MFC -MFC mine clearance MFC mine MFC mine MFC mine MFC mine MFC
- 2023-04-26 07:50:03下载
- 积分:1