一个类ＣＡＲＤ牌的小程序，可以作到抛砖引玉吧

DIY一块廉价的51串行编程器-DIY a cheap 51 UART programme device

这个程序罗列了VC++如何制作DLL的一系列过程，可以参考-How to develop windows DLL by VC++.

VC＋＋编写的一个操作系统多线程调度的可视化示例程序显示了OS多线程调度的基本运行规则-prepared in a multi-threaded operating system scheduling visualization shows the sample program multithreaded OS scheduling the basic operating rules

This a rs232c communication software sample

Windows Mobile 5.0 三十几个经典手机软件开发源码希望对大家有帮助.-Windows Mobile 5.0 30 phone several classic source software development we hope to have help.

前一段时间，我开发一个有关硬件的程序，需要初始化很长时间，为了防止用户误认为程序已经死掉，必须显示一个漂亮的界面让用户没有这种误解。就像我们系统拷贝很大的文件的时候显示的窗体一样。可惜我没有找到，只有自己亲自开发了。开发一个类，继承于CWnd,很方便。代码比较简单希望有兴趣的朋友下载看看。-some time ago, I developed a hardware-related procedures, the need to initialize a very long time, in order to prevent users mistakenly believe that the procedure has survived, must show a pretty interface to let users do not have this misconception. Like our system great copy of the document shows the same window. Unfortunately, I did not find that only personally developed. The development of a class, in succession CWnd, very convenient. Hope relatively simple code are interested to see friends download.

21天学通C++，Jesse Liberty 和Bradley Jones编著 第五版课程上面的程序案例。-21-day study-pass C++, Jesse Liberty and Bradley Jones compiled the fifth edition of the course the above procedure cases.

内容 * 联系人 * 安装 * 构建连接器/c + + 的先决条件 * 在 Unix 上的建筑 * 运行 CMake 生成生成文件 * 使用使建立图书馆 * CMake 选项: MySQL 的安装路径，调试版本和更多 * 在 Solaris 上的建筑 * 在 Windows 上的建筑 * 源布局 * (如果二进制包) 建设进一步平台注释

数据结构顺序表基本操作典型 是自己写的 还好-if 结构

LCS问题就是求两个字符串最长公共子串的问题。解法就是用一个矩阵来记录两个字符串中所有位置的两个字符之间的匹配情况，若是匹配则为1，否则为0。然后求出对角线最长的1序列，其对应的位置就是最长匹配子串的位置。 最长递增子序列LCS的实现C源码！-LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two strings of all the matches between the two characters in the situation, if the match is one, otherwise to 0. And one of the longest diagonal obtained sequence, the location of its corresponding sub-string match is the longest position. The longest increasing sub-sequence source C implementation of the LCS!