-
This one a typical one number value issue, is it is it belong to algorithm ask a...
这是一个典型的非数值问题，如果使用非递归算法求解此问题，要设计复杂的算法，编写很长的程序。而使用递归算法可以使整个算法清晰，使程序简洁。本问题分析并建立递归算法的过程是典型的抽取问题本质、建立递归算法 并最终解决非数值问题递归实例。-This one a typical one number value issue, is it is it belong to algorithm ask and solve this question to pass to use, design the complicated algorithm , will write very long procedure . It can make the whole algorithm clear and use and pass and belong to the algorithm, make the procedure succinct . Case study this is it is it belong to course of algorithm typical extraction issue essence , is it pass algorithm of belonging to to set up to pass to set up And it is not a number value problem to solve finally and pass and belong to the instance
- 2022-05-23 18:27:16下载
- 积分：1
-
思思暮暮、寻寻觅觅、相见恨晚、爱不释手、共产共荣
思思暮暮、寻寻觅觅、相见恨晚、爱不释手、共产共荣-一个多么神奇的开发包，用于实施数据处理算法研究-思思evening twilight, searching, Brief Encounter, put it down, the communist prosperity- what a fantastic development kit for the implementation of data-processing algorithms and so on
- 2022-01-25 14:46:29下载
- 积分：1
-
分形 visual c + +
此程序是一个分形程序，此程序必须工作在 visual c + + 中与 windows 98 和 xp 和不工作由赢 7
- 2023-03-11 16:40:04下载
- 积分：1
-
vc++6.0实效编程百例的源码，非常好的一本书
vc++6.0实效编程百例的源码，非常好的一本书-vc++6.0 100 cases of the effectiveness of programming
- 2023-01-26 03:25:06下载
- 积分：1
-
Wince下自动搜索SD卡的有EXE文件.
Wince下自动搜索SD卡的有EXE文件.-Wince automatically search SD card are EXE files.
- 2022-02-14 03:32:51下载
- 积分：1
-
C #浏览器的JS调用的问题。rar
c# WebBrowser与JS互相调用问题.rar-c# WebBrowser problem with the JS call each other. rar
- 2022-01-26 04:52:37下载
- 积分：1
-
一些有用的，又漂亮的图标，晶莹剔透，编程一样少不了的拉^_^...
一些有用的，又漂亮的图标，晶莹剔透，编程一样少不了的拉^_^-some useful and beautiful icon, and sparkling, the same programming missed the Rafah ^ _ ^
- 2022-01-22 00:34:42下载
- 积分：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
-
一个创建 对象的小程序，可以作到抛砖引玉吧
一个创建 对象的小程序，可以作到抛砖引玉吧-A small program to create the object, you can definitely do it
- 2022-03-24 20:21:07下载
- 积分：1
-
插件式开发例子
c#插件式开发例子
c#插件式开发例子
c#插件式开发例子
c#插件式开发例子
c#插件式开发例子
c#插件式开发例子
- 2022-03-25 22:56:53下载
- 积分：1
