搜索资源列表
sqrt
- 求解正数的算数平方根，非c语言自带函数！-Solution is the square root of the number of counts, non-c language of its own function!
genhaoC
- 牛顿迭代法开根号 比库函数sqrt()快-more efficient way in sqrt
chuanshuo
- 判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。-Method to determine the prime numbers: a number were removed 2 to sqrt (this number), if divisible, it indicates that this number is not prime, and vice versa is a prime number.
KalmanGain
- 卡尔曼滤波在单片机上的应用 KalmanGain = EstimateCovariance * sqrt( 1 / ( EstimateCovariance * EstimateCovariance + MeasureCovariance * MeasureCovariance ))； //计算本次滤波估计值 EstimateValue = EstimateValue + KalmanGain*（ Measure – EstimateValue ）； //更新估计协方差 Es
script2_music_circulaire.m.tar
- fs = 8000 t = (0:1/fs:1). x1 = cos(2*pi*t*300) x2 = cos(2*pi*t*400) ha = phased.ULA( NumElements ,10, ElementSpacing ,1) ha.Element.FrequencyRange = [100e6 300e6] fc = 150e6 x = collectPlaneWave(ha,[x1 x2],[10 20 45 60] ,fc) rng def
Desktop
- #include<stdio.h> #include<math.h> main() { int i,x scanf(" d",&x) for(i=2 i<=x-1 i++) if(x i==0) printf("NO\n") for(i=2 i<=x/2 i++) for(i=2 i<=sqrt(x) i++) } 第十行不加冒号时出错信息为： C:\Documents and Settings\w
codings
- codings for layer Program 13.1 Golden Section Search for minimum of f(x) Start with unimodal f(x) and minimum in [a,b] Input: inline function f, interval [a,b], number of steps k Output: approximate minimum y function y=gss(f,a,b,k) g=(s