D3D游戏鼠标键盘控制基础。。。学3D的朋友不要错过。

卡销售系统值得研究一下！！ ！！ -card sales system worthy of study!

 MEMORY { PAGE 0: VECS: org=0x0080, len=0x80 PROM: org=0x1000, len=0x1000 /* 4k words */ PAGE 1: STACK: org=0x100, len=0x400 /* 1k words */ DARAM: org=0x2000, len=0x1000 /* 4k words */ } SECTIONS { .text :> PROM PAGE 0 vectors :> VECS PAGE 0 .bss :> DARAM PAGE 1 .data :>  DARAM PAGE 1 } 

一个课程实验，十分有参考价值，

一个计算器的小程序，非常短小。可以加减乘除和清零。-A calculator small program, very short. Addition and subtraction and multiplication and division can be cleared.

这是windows绕过UAC的源代码。

Implementation of an Interval Iterative Closest Point that uses intervals to found the global optimal solution. ICP can be used in vision technologies and photogrametry as pattern mathcing and as geometrical model finder. -Implementation of an Interval Iterative Closest Point that uses intervals to found the global optimal solution. ICP can be used in vision technologies and photogrametry as pattern mathcing and as geometrical model finder.

开发工具是vs2013加上一个easyx的图形库，代码量在400-500行左右，非常适合c语言学的比较好的人拿来练手，把所学的c语言语法知识与具体的项目相结合。

三星3.5寸屏windows ce 驱动程序-Samsung 3.5-inch screen windows ce driver

剪贴板源代码copypaste_dragdrop-clipboard source copypaste_dragdrop

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