多

用于直线和椭圆的检测，检测效果不错，查全率较高，为亚像素精度。

利用MFC实现的能够能够在对话框里面编辑HTM的程序-Can be achieved using MFC in a dialog box can be edited inside the HTM program

这是一个经典的数据结构算法．是最小路径的搜索算法，有些书上有介绍，但这次提供的是可以运行的程序．-This is a classic algorithm data structure. It is the smallest path search algorithms, there are some books, but this can be provided by a running program.

两个乒乓球队进行比赛，各出3人。甲队为a,b,c三人，乙队为x,y,z三人，已抽签决定比赛名单。有人向队员打听比赛的名单，a说他不和x比，c说他不和x,z比，请编程序找出三队赛手的名单。-Two table tennis team competition, each person 3. A team for a, b, c three B teams for the x, y, z three, has decided to match the list of drawing. It was asked to match the list of members, a said that he did not and the x ratio, c said that he did not, and x, z ratio, the procedure is requested for three teams racing to find the list.

两者共享同一个临时应用程序配置（C#）

编译原理实验一词法分析源程序及简单的测试数据-Principles of Experimental Analysis of the term compile source code and test data

这个程序是用MFC来实现的能够读出MAC地址，并能够以显示出地址，以16进制的形式-This procedure is used to achieve the MFC to read out the MAC address, and be able to demonstrate address, 229 to 16 in the form of

C++语言程序设计实例荟萃(内含11个经典实例)-C++语言程序设计实例荟萃

 WinSock网络编程经络_源码 很方便初学者学习使用 里面对各种网络类型通信 有详细介绍   WinSock网络编程经络_源码 很方便初学者学习使用 里面对各种网络类型通信 有详细介绍  WinSock网络编程经络_源码 很方便初学者学习使用 里面对各种网络类型通信 有详细介绍  WinSock网络编程经络_源码 很方便初学者学习使用 里面对各种网络类型通信 有详细介绍

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