多维傅里叶变换，二维DFT快速算法，共分五部

insertion_sort.cpp #include #include #include #define N 5000 int insertion_sort( int data_insert[] ); void creat_file( char *file_name, int data_file[] ); int main(int argc, char *argv[]){    int data[N];    creat_file( argv[1], data ); 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

huge hex convert to dec. the value limite is less that 10^50-huge hex convert to dec. The value is limite less that 10 ^ 50

全排序- All arranges

一个排序过程的演示- A arrangement process demonstration

点集凸包( 收缩法)Jarris步进法-point set convex hull (contraction) Jarris Step Method

L语言编译器的设计与实现，词法分析最后产生token文件和符号表文件，然后进行语法分析和语义分析，采用的是递归下降方法，最后产生四元式，通过中间代码产生目标代码

模糊PID算法，实现了求交法计算模糊蕴含关系、最大最小法进行合成运算、求并法计算输出量的模糊集合、加权平均法计算实际的清晰控制量等部分的详细代码。模糊算法，实现了求交法计算模糊蕴含关系、最大最小法进行合成运算、求并法计算输出量的模糊集合、加权平均法计算实际的清晰控制量等部分的详细代码。-Fuzzy algorithm,

资源描述CS7495 Final Project  Sooraj Bhat Object Removal by Exemplar-based Inpainting USING THE CODE Everything was done in Matlab and MEX (i.e. a C function callable from Matlab).  First, the C code needs to be compiled.  At the Matlab prompt, type:    mex bestexemplarhelper.c You should then be able to run the following (which takes ~2mins on my 2GHz Pentium 4 laptop with 256MB of RAM):    [i1,i2,i3,c,d,mov] = inpaint("bungee0.png","bungee1.png",[0 255 0]); A smaller run (~25 seconds) would be:    [i1,i2,i3,c,d,mov] = inpaint("bw0.png","bw2.png",[0 255 0]); To visualize:    plotall;    close; movie(mov); SAMPLE IMAGES & RESULTS *0.png      The original images ("bw" and "bungee") *{1,2}.png    The different fill region masks. *P2.png     &nbs

遗传算法是近来较为热门的结构优化方法,C源代码-Genetic algorithm is more popular in recent structural optimization methods, C source code

这是我用verilog hdl语言写的浮点乘法器,用的是基4的booth算法,对于部分积使用了5-2压缩和3-2压缩,欢迎大家指点,也欢迎大家把它改成流水线以提高速度.-This is my verilog hdl language used to write floating-point multiplier, using a Radix-4 algorithm for the booth for part of the plot using the 5-2 and 3-2 compression compression, welcomed everyone pointing, also welcomed the U.S. put it into a pipeline to improve speed.