代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/432144/8624868
c 10.6 积分一步的变步长基尔方法 gil.c
#include "stdlib.h"
#include "math.h"
void gil(t,h,y,n,eps,q,f)
void (*f)();
int n;
double t,h,eps,y[],q[];
{ int i,j,k,m,ii;
double x,p,hh,r,s,t0,dt,qq,*d,*u,*v,*g;
s
www.eeworm.com/read/432144/8624872
c 10.7 全区间积分的变步长默森方法 mrsn.c
#include "stdlib.h"
#include "math.h"
void mrsn(t,h,n,y,eps,k,z,f)
void (*f)();
int n,k;
double t,h,eps,y[],z[];
{ int i,j,m,nn;
double aa,bb,x,hh,p,dt,t0,qq,*a,*b,*c,*d,*u
www.eeworm.com/read/432144/8624888
c 10.5 积分一步的变步长龙格-库塔方法 rkt2.c
#include "stdlib.h"
#include "math.h"
void rkt2(t,h,y,n,eps,f)
void (*f)();
int n;
double t,h,eps,y[];
{ int m,i,j,k;
double hh,p,dt,x,tt,q,a[4],*g,*b,*c,*d,*e;
g=mall
www.eeworm.com/read/432144/8624896
c 10.9 全区间积分的双边法 gjfq.c
#include "stdlib.h"
#include "math.h"
void gjfq(t,h,n,y,eps,k,z,f)
void (*f)();
int n,k;
double t,h,eps,y[],z[];
{ void rkt();
int i,j;
double a,qq,*d,*p,*u,*v,*w;
www.eeworm.com/read/432144/8625034
c 9.15 计算多重积分的蒙特卡洛法 mtml.c
#include "stdlib.h"
#include "math.h"
#include "3rnd1.c"
double mtml(n,a,b,f)
int n;
double a[],b[],(*f)();
{ int m,i;
double r,s,d,*x;
x=malloc(n*sizeof(double));
www.eeworm.com/read/288527/8625490
c memory.c
/*----------------------------------------------------------------------------*/
/* memory.c - memory management routines for sga code */
/*----------------------------------
www.eeworm.com/read/431721/8658730
c 7ngin.c
#include "math.h"
#include "stdlib.h"
#include "6gmiv.c"
int ngin(m,n,eps1,eps2,x,ka,f,s)
void (*f)(),(*s)();
int m,n,ka;
double eps1,eps2,x[];
{ int i,j,k,l,kk,jt;
doubl
www.eeworm.com/read/431721/8658780
c 7netn.c
#include "stdlib.h"
#include "math.h"
#include "stdio.h"
#include "6gaus.c"
int netn(n,eps,t,h,x,k,f)
int n,k;
void (*f)();
double eps,t,h,x[];
{ int i,j,l;
double am,
www.eeworm.com/read/431721/8658949
c 12lplq.c
#include "stdlib.h"
#include "4rinv.c"
#include "4trmul.c"
int lplq(a,b,c,m,n,x)
int m,n;
double a[],b[],c[],x[];
{ int i,mn,k,j,l,*js;
double s,z,dd,y,*p,*d;
js=mall
www.eeworm.com/read/431721/8659128
c 6gmqr.c
#include "4maqr.c"
#include "stdlib.h"
int gmqr(a,m,n,b,q)
int m,n;
double a[],b[],q[];
{ int i,j;
double d,*c;
int maqr(double [],int,int,double []);
c=malloc(n*size