近似PI使用蒙特卡罗方法

只适合新手的基础算法,包含大数相加， 反序输出，鸡兔同笼，回环数组等代码

一个bp算法，不过代码可能会有一些warning-1 bp algorithm, but there may be some code warning

fft傅立叶快速变换在图象处理方面的应用-fft Fast Fourier Transform in Image Processing Applications

设计出一个算法，贪吃蛇小游戏怎么做出来的，利用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

The mathematic method K-Means with delphi, a smaal essay, with graphic representation-The mathematic method K-Means with delphi, a smaal essay, with graphic representation....

这就是广度优先搜索和 8 拼图算法在求解 8 益智游戏的执行。 使用的语言是 java，代码中的注释将帮助与其余部分 ！

一个生成最小树的算法，应用在VLSI中-generate a minimum spanning tree algorithm used in VLSI

先序遍历非递归算法 #define maxsize 100 typedef struct { Bitree Elem[maxsize] int top }SqStack void PreOrderUnrec(Bitree t) { SqStack s StackInit(s) p=t while (p!=null !StackEmpty(s-preorder non- recursive algorithm# define maxsize 100 typedef struct (Bitree Elem [maxsize]) int top SqStack void PreOrderUnrec (Bitree t) (SqStack s StackInit (s) p = t while (p! = Null! StackEmpty (s

详细表述了分数阶傅立叶变换的离散实现，将现有的算法进行比较。-In this note we make a critical comparison of some matlab programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that lters the best out of the existing ones. Two types of transforms are considered: First the fast approximate fractional Fourier transform algorithm for which two algorithms are available. The method is described in H.M. Ozaktas, M.A. Kutay, and G. Bozdagi. Digital computation of the fractional Fourier transform. IEEE Trans. Signal Process., 44:2141{2150, 1996. There are two implementations: one is written by A.M. Kutay the other is part of package written by J. O Neill. Secondly the discrete fractional Fourier transform algorithm described in the master thesis C . Candan. The discrete fractional Fourier transform, Bilkent Univ., 1998 and an algorithm described by S.C. Pei, M.H. Yeh, and C.C Tseng: Digital fractional Fourier transform base

数个关于滤波器的产生的C程序，以及示例，来自《C语言数值常用程序》，所以程序均经过本人测试可以正常使用！-few of the filter C procedures, as well as examples from the "C language commonly used numerical procedures," and so I have to undergo testing can be used normally.