Minesweeping game, using Visual c++ Debugging with C to prepare

利用多嘴猫硬件开发的呼叫系统，内置lg的mes通信接口

派生类实验 VC++ 价值很高 初学者参考-paisheng experiment VC++

开始使用messenger聊天的克隆应用程序。这段代码用delphi编写，主题相同。享受并尝试制作一个程序作为messenger聊天到您的公司或自己；）

测试串口 可以发送数据到串口，转换16进制字符串到字节数组-Serial test data can be sent to the serial port, conversions of 16 hexadecimal string to byte array

该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the complexity of O (n* m).

this is a airlines project system

这是java开发的一些小程序,对于学习Java很有帮助-This is the development of some small procedures, helpful for learning Java

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

JXTA代码,美丽的排偶癞瓜内 -JXTA code, beautiful skin disease排偶Guarneri JXTA code, beautiful skin disease排偶Guarneri

带有TimeSpan的分钟计数器