代码搜索：相差法
找到约 10,000 项符合「相差法」的源代码
代码结果 10,000
www.eeworm.com/read/339906/12195267
doc 变换尺度法+罚函数法.doc
www.eeworm.com/read/289579/8541923
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/289058/8581941
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/288578/8620718
obj 气泡法.obj
www.eeworm.com/read/288578/8620754
exe 气泡法.exe
www.eeworm.com/read/287060/8728644
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/187300/8834732
txt 追赶法.txt
function X=mypursue(A)
[n,m]=size(A);
a=zeros(1,n);
a(2:n)=diag(A,-1);
c=diag(A,1);
d=diag(A);
if d(1)==0
'error'
return
end
p(1)=d(1);
q(1)=c(1)/p(1);
for k=2:n-1
p(k)=d(k)-a
www.eeworm.com/read/428233/8881980
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/383218/8960419
c 追赶法.c
#include
#define N 10
void main()
{
float a[N],b[N],c[N],f[N];
int i,n,j;
printf("input n:");
scanf("%d",&n);
printf("input a:\n");
for(i=2;i
www.eeworm.com/read/282606/9080486
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