代码搜索：查表法
找到约 10,000 项符合「查表法」的源代码
代码结果 10,000
www.eeworm.com/read/120884/14784387
cpp 割线法.cpp
#include
#include
double x=0;
double f(double x)
{
return (x*x*x-7.7*x*x+19.2*x-15.3);
}
/*由于文件太小 所以加了这么几个字 世界答复会计师拉丁；风纪扣发生搭街坊历史；非金属；安放贷款；扩大解放了；撒旦咖啡碱了；深刻搭街坊了解撒旦法；搭街坊离开；地方 *
www.eeworm.com/read/219123/14893630
txt 割线法.txt
#include
#include
#define N 100
#define eps 1e-6
#define eta 1e-8
float Gexian(float(*f)(float),float x0,float x1)
{
float x2,d0,d1;
int k=0;
do
{
x2=x1-(*f)(x1)*(x
www.eeworm.com/read/218376/14924230
cpp 幂法.cpp
#include
#include
#define N 3
#define EPS 1e-6
#define KM 30
void PowerMethod(float *A)
{
float MaxValue(float *,int );
float U[N],V[N],r2,r1;
float temp;
int i,j,
www.eeworm.com/read/214867/15085842
m 限幅法.m
%%Clipping and Filtering
% Repeated Clipping and Filtering--PAPR Simulation
%
% Reference: J. Armstrong, New OFDM peak-to-average power reduction scheme.
%
% Author: Bin Jiang
% National M
www.eeworm.com/read/209874/15212371
cpp 牛顿法.cpp
#include
#include
double f(double x);
double fr(double x);
void main()
{
double x0,x1,e;
int N;
coute>>N;
int k=1;
L:
www.eeworm.com/read/11251/214809
pdf 回溯法.pdf
www.eeworm.com/read/11251/214813
pdf 递推法.pdf
www.eeworm.com/read/11251/214815
pdf 贪婪法.pdf
www.eeworm.com/read/13112/268458
c 排序法.c
#include
#include
struct node
{
int key;
}r[20];
struct rnode
{
int key;
int point;
};
main()
{
void print(struct node a[20],int n);
int creat();
void shell
www.eeworm.com/read/327496/3455354
c 排序法.c
#include
#include
struct node
{
int key;
}r[20];
struct rnode
{
int key;
int point;
};
main()
{
void print(struct node a[20],int n);
int creat();
void shell