基于高斯模型的opencv颜色识别

提供的为清华大学出版社出版的C常用算法程序集一书中的程序-of Qinghua University Press published for the C algorithm commonly used procedures set a book of procedures

迷宫算法，求解从起点到终点的迷宫路径，或者得出没有路径的结论。-Maze algorithm, to solve from the point of origin to the end of the maze path, or there is no path to draw conclusions.

设计出一个算法，贪吃蛇小游戏怎么做出来的，利用C++语言编写，代码简单，很容易看懂，function [p,ff] = oct3bank(noi);  pi = 3.14159265358979;  Fs = 500000;    %1/(t(2)-t(1));     % Sampling Frequency N = 3;      % Order of analysis filters.  %f=[1.00 1.25 1.60 2.00 2.50 3.15 4.00 5.00 6.300 8.00] ff=[20 25 31.5 40 50 63 80 100 125 160 200 250 315 400 500 630 800 1000 1250 1600 2000 2500 3150 4000 5000 6300 8000 10000 12500 16000] %ff = ((2^(1/3)).^[0:19]);  % Exact center freq.   p = zeros(1,30); % Design filters and compute RMS powers in 1/3-oct. bands

不动迭代算法 计算方法-Fixed iterative algorithm calculation method

产生随机数相关的C程序-generated random numbers related to the C program

区间消去法，主要用于解决优化问题中的区间确定问题-Interval elimination method, mainly for optimization problems to resolve the issues identified in the interval

应用背景本程序是基于verilog编写的ram冒泡排序程序，可将任意输入的16个64比特的数进行排序，仿真都通过，可在其上修改进行更大数据量的排序，对开发FPGA有很大的借鉴意义关键技术利用冒泡排序实现的verilog程序，通过构建状态机实现，可由FPGA开发板实现，本程序是对16个数进行排序，可在其上进行任意数任意大小的扩充

图形界面的计算器，使用VC++开发，绝对经典可用，好用，好用的-calculater

*   *   To approximate I = integral ( ( f(x) dx ) ) from a to b:*   *   INPUT:   endpoints a, b; integer n.**   OUTPUT:  an array R. ( R(2,n) is the approximation to I. )**   R is computed by rows; only 2 rows saved in storage   

Ordinary and Partial Differential Equation Routines in C, C++, Fortran, Java, Maple, and MATLAB