Learning c++ Courseware hope that we can be better shared, at the same time want...

视觉小游戏,可运用到多媒体中,光点追踪闪烁, 值得参考,运行通过,做了一些优化.-Visual game can be applied to multimedia, optical point tracking blinking, it is also useful, run through, to do some optimization.

这个试圆周率的Machin算法，在这里共享，希望对大家有所帮助，看看这个算法会有启发！-test the ratio of the circumference Machin algorithm, in sharing, we want to help, look at this algorithm will be inspired!

度量衡转换器WCE 源代码。包含长度，重量，体积，面积的公制，英制单位转换。-Weights and Measures WCE source code converter. Contains the length, weight, volume, area metric, Imperial units conversion.

Microsoft Windows 脚本技术，包含vScript和JScript两种脚本，是你编程的最好辅助工具，肯定对你学习或者工作有用-Microsoft Windows scripting technologies, including two vScript and JScript scripting, you the best programming tool which will certainly be useful to your work or study

Windows ce的一本非常好的教程 windowce-Windows ce of a very good tutorial windowce

自动ping出来，然后挂断。非常好的一个东西。没密码-Automatically ping out, and then hang up. A very good thing. No password

《COM应用程序框架》是把标准的Microsoft Windows多文档处理应用程序使用COM技术来设计，这是文章的配套代码。 -"COM application framework" is the standard Microsoft Windows Multi- Document Service Jimmy applications that use COM technology to design, which is supporting the article code.

音频编码的代码比较实用-useful source code about audio encode

Linux 下串口编程入门，大家有兴趣就看看吧-Introduction to serial programming under Linux, we are interested to take a look at it

以深度为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).