Bresenham算法画圆的实现

《【OpenCV入门指南】第三篇Canny边缘检测》中介绍了边缘检测，本篇介绍轮廓检测，轮廓检测的原理通俗的说就是掏空内部点，比如原图中有3*3的矩形点。那么就可以将中间的那一点去掉。在OpenCV中使用轮廓检测是非常方便。直接使用cvFindContours函数就能完成对图像轮廓的检测。下面就来看看这个函数的用法。

隐MARKOV经典算法，也是通用算法，linux环境，可以移植到windows-Hidden Markov classic algorithms, as well as generic algorithms, linux environment, can be transferred to the windows

本示例将写入的字符串"Hello World"启动。这一切后上输入 RXD 接收的字符回显到 TXD 输出。 在 nRF6700 中的测试 nRF24LE1

计算负载使用牛顿拉夫逊法 method.case ieee14 节点系统的流量。

改进的蚁群算法程序-improved program of ant conoly algorithm

栈是限定仅在表头进行插入和删除操作的线性表。通常将递归算法转换成非递归算法时需要使用栈。本代码实现了栈的顺序存储结构，对迷宫问题的求解进行了具体实现，并且代码能正确编译及运行。

通过对串口和网口的封装，使其只调用一个接口，实例化自己的设备对象，就能够调用相应的读写操作，能够实现统一

解压后的文件，列举了大量常用的C算法程序，欢迎参考！-unpacked document, listed a number of commonly used algorithm C procedures, reference welcome!

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7