窗口处理程序的源码，里面包含八个工程，对于初学windows编程的同学来说是很有用的...

以前用的，各个窗口控件使用的一一展示，是一个演示窗口控件使用帮助学习VC++的小软件。仅适用版本是VC++ 6.0 ，经本人测试验证，在VC 2005下无法加载，（见谅~_~）!适合初中学者使用（谁敢说自己是高级经验者，哈哈！）奉献大家，希望有好评！-Previously used in various window controls used to display 11, is a demonstration of the window to help control the use of learning VC++ Small software. Applies only to version VC++ 6.0, as I test verification, in VC 2005 can not load, (~_~)! apologize for the use of junior scholars (Who can say that he is a senior experience, ha ha!) Dedication everyone, hope has received!

按照日期名称自动生成文件，以及事件响应的使用-By date automatically generated file name, as well as the use of Incident Response

保留原有工具调入WORD工具的原代码-transferred to retain the existing tools WORD-source tools

在应用程序中设置打印选项-application procedures set print options

文字的颜色渐变的源程序-text color gradient of the source

一个计算器的源代码，适合参考-a calculator source code for reference

vfw编程进行数字摄像头视频捕获-VFW programming for digital camera video capture

NFC刷卡系统上位机驱动程序，封装成dll动态链接库，方便PB、vb等程序直接调用dll提供的借口，实现对NFC的读卡操作。已编译通过，测试可行。

dct verilog code for image -Extra Verilog code for image

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