代码搜索:全差分
找到约 10,000 项符合「全差分」的源代码
代码结果 10,000
www.eeworm.com/read/362558/9992239
rar 算法9.14分配排序.rar
www.eeworm.com/read/164541/10103568
cpp 二分法.cpp
#include
#include
double f(double x)
{
double y=sqrt(x);
return y;
}
void g(double e,double a,double T0,double h,int k)
{
double T;
double F=0;
for(int i=1;i
www.eeworm.com/read/359101/10165923
cpp 二分法.cpp
#include
#include
#define EPS 5e-6 //根容许的误差
#define DELTA 1e-6 //|f(x)|容许的误差
float Bisection( float a,float b,float (*f)(float) )
{
float c,fc,fa=f(a),fb=f(b);
int n=1;
www.eeworm.com/read/357750/10201788
ms8 网賯分暐_.ms8
www.eeworm.com/read/357750/10201790
ms8 鞑谱分暐_.ms8
www.eeworm.com/read/357066/10216654
cpp 二分法.cpp
#include
#include
#define EPS 5e-6 //根容许的误差
#define DELTA 1e-6 //|f(x)|容许的误差
float Bisection( float a,float b,float (*f)(float) )
{
float c,fc,fa=f(a),fb=f(b);
int n=1;
www.eeworm.com/read/280892/10281847
zip 二分查找binarysearch.zip
www.eeworm.com/read/425707/10335616
ppt 二分法.ppt
www.eeworm.com/read/279550/10421411
txt pku 1064 二分查找.txt
#include
#include
#include
#include
using namespace std;
//PKU 1064 二分查找
#define NMAX 10005
#define MINI 0.000001
double len[NMAX];
void solve(
www.eeworm.com/read/353190/10466079
frm 二分法.frm
VERSION 5.00
Begin VB.Form Form1
Caption = "二分法解方程"
ClientHeight = 3975
ClientLeft = 60
ClientTop = 345
ClientWidth = 7080
BeginProperty F