代码搜索：相差法

找到约 10,000 项符合「相差法」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/128112/14315144

dsp 哈希表链地址法.dsp

# Microsoft Developer Studio Project File - Name="哈希表链地址法" - Package Owner= # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) C
·
www.eeworm.com/read/128112/14315146

cpp 哈希表链地址法.cpp

// 哈希表链地址法.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include #include #define MAX 100 int ha[MAX],hlen[MAX],n,m,p; void cre
·
www.eeworm.com/read/128112/14315147

dsw 哈希表链地址法.dsw

Microsoft Developer Studio Workspace File, Format Version 6.00 # WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE! ###############################################################################
·
www.eeworm.com/read/228261/14394664

txt 筛选法求素数.txt

#define RANGE 200 #include void main() { 　int sieve[RANGE + 1]; 　int i,j,count; 　for(i = 0;i
·
www.eeworm.com/read/126879/14396213

c fortran 90牛顿法.c

Fortran 90牛顿法！ !!!本程序适用于求解形如f(x)=1/2*x'Ax+bx+c二次函数的稳定点； !!!输入函数信息，输出函数的稳定点及迭代次数； !!!iter整型变量，存放迭代次数； !!!x为n维变量，初始值由用户输入；gradt实型变量，存放函数梯度; !!!dir实型变量，存放搜索方向；x0实型变量，存放步
·
www.eeworm.com/read/125230/14504947

doc 层次分析法.doc

·
www.eeworm.com/read/225373/14543758

cpp 方向加速powell法.cpp

#include "mathyw.h" #include "iostream.h" #include "stdlib.h" #include "math.h" double fun( double * x ); void main () { double p[3] = { 0.5, 1, 0.5 }; double * x = new double[3]; Pow
·
www.eeworm.com/read/225373/14543766

cpp 信赖域牛顿法.cpp

#include "mathyw.h" #include "iostream.h" #include "stdlib.h" #include "math.h" double fun( double * x ); void main () { double p[2] = { 0, 3 }; double * x = new double[2]; newton_reg
·
www.eeworm.com/read/225373/14543780

cpp dfp变尺度法.cpp

#include "mathyw.h" #include "iostream.h" #include "stdlib.h" #include "math.h" double fun( double * x ); void main () { double p[2] = { -3, 3 }; double * x = new double[2]; DFP_searc
·
www.eeworm.com/read/122735/14670982

txt 逆broyden秩序法.txt

function[x,k]=broyden1(fun,dfun,x,tol,trace) k=0; f=feval(fun,x); df=feval(dfun,x); B=inv(df); while(k
·