代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/432144/8623907
c 6.12 求解对称正定方程组的共轭梯度法 grad.c
#include "4trmul.c"
#include "math.h"
#include "stdlib.h"
#include "stdio.h"
void grad(a,n,b,eps,x)
int n;
double a[],b[],x[],eps;
{
int i,k;
double *p,*r,*s,*q,alpha,beta,d,e;
v
www.eeworm.com/read/432144/8624450
c 4.5 对称正定矩阵的求逆 ssgj.c
#include "stdlib.h"
#include "math.h"
#include "stdio.h"
int ssgj(a,n)
int n;
double a[];
{
int i,j,k,m;
double w,g,*b;
b=malloc(n*sizeof(double));
for (k=0; k
www.eeworm.com/read/432144/8624670
c 15.7 拓扑排序 topo.c
#include "stdlib.h"
void topo(n,r,m,p)
int n,m,p[],r[];
{ int top,i,j,k,t,*s,*g,*f;
struct node
{ int suc;
int next;
} *q;
q=(struct node *)malloc(m*sizeo
www.eeworm.com/read/432144/8624786
c 10.11 全区间积分的哈明法 hamg.c
#include "stdlib.h"
#include "math.h"
void hamg(t,h,n,y,eps,k,z,f)
void (*f)();
int n,k;
double t,h,eps,y[],z[];
{ void rkt();
int i,j,m;
double a,q,*b,*d,*u,*v,*w,*g;
www.eeworm.com/read/432144/8624791
c 10.4 全区间积分的定步长龙格-库塔方法 rkt1.c
#include "stdlib.h"
void rkt1(t,y,n,h,k,z,f)
void (*f)();
int n,k;
double t,h,y[],z[];
{ int i,j,l;
double a[4],tt,*b,*d;
b=malloc(n*sizeof(double));
d=malloc(n*size
www.eeworm.com/read/432144/8624795
c 10.10 全区间积分的阿当姆斯预报校正法 adms.c
#include "stdlib.h"
#include "math.h"
void adms(t,h,n,y,eps,k,z,f)
void (*f)();
int n,k;
double t,h,eps,y[],z[];
{ void rkt();
int i,j,m;
double a,q,*b,*e,*s,*g,*d;
www.eeworm.com/read/432144/8624816
c 10.3 全区间积分的维梯方法 wity.c
#include "stdlib.h"
void wity(t,y,n,h,k,z,f)
void (*f)();
int n,k;
double t,h,y[],z[];
{ int i,j;
double x,*a,*d;
a=malloc(n*sizeof(double));
d=malloc(n*sizeof(doubl
www.eeworm.com/read/432144/8624821
c 10.12 积分一步的特雷那法 tnr.c
#include "stdlib.h"
#include "math.h"
void tnr(t,h,n,y,f)
void (*f)();
int n;
double t,h,y[];
{ int j;
double s,aa,bb,dd,g,dy,dy1,*d,*p,*w,*q,*r;
w=malloc(4*n*sizeof(d
www.eeworm.com/read/432144/8624841
c 10.2 积分一步的变步长欧拉方法 elr2.c
#include "stdlib.h"
#include "math.h"
void elr2(t,h,y,n,eps,f)
void (*f)();
int n;
double t,h,eps,y[];
{ int i,j,m;
double hh,p,x,q,*a,*b,*c,*d;
a=malloc(n*sizeof(doub
www.eeworm.com/read/432144/8624857
c 10.8 积分一步的连分式法 pbs.c
#include "stdlib.h"
#include "math.h"
void pbs(t,h,n,y,eps,f)
void (*f)();
int n;
double t,h,eps,y[];
{ void rkt();
int i,j,k,m,nn,it;
double x,hh,dd,q,p,g[10],*b,*d,