代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/287194/8710853
c 4ssgj.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/287194/8710865
c 9mtml.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/287194/8711008
c 15topo.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/287194/8711057
c 13lman.c
#include "stdlib.h"
#include "4rinv.c"
int lman(n,m,k,f,q,r,h,y,x,p,g)
int n,m,k;
double f[],q[],r[],h[],y[],x[],p[],g[];
{ int i,j,kk,ii,l,jj,js;
double *e,*a,*b;
e=mallo
www.eeworm.com/read/386996/8714322
c massey.c
/*
Author: Pate Williams (c) 1997
The following code tests an implementation of
the Berlekamp-Massey algorithm for finding the
linear complexity of a finite binary sequence.
Th
www.eeworm.com/read/286954/8735182
c dynamic.c
# include
# include
# define NUM 10
int main()
{
char *str[NUM]; /* 定义一个字符性的指针数组 */
int t;
/* 为数组中的每个指针分配内存 */
for(t=0; t
www.eeworm.com/read/286954/8735268
c euler.c
#include "stdio.h"
#include "stdlib.h"
#include
int Func(y,d)
double y[],d[];
{
d[0]=y[1]; /*y0'=y1*/
d[1]=-y[0]; /*y1'=y0*/
d[2]=-y[2]; /*y2'=y2*/
return(1);
}
void E
www.eeworm.com/read/286954/8735284
c grkt10.c
#include "stdio.h"
#include "stdlib.h"
void RKT(t,y,n,h,k,z)
int n; /*微分方程组中方程的个数，也是未知函数的个数*/
int k; /*积分的步数(包括起始点这一步)*/
double t; /*积分的起始点t0*/
double h; /*积分的步长*/
double y[]; /
www.eeworm.com/read/286908/8737884
c~ tch.c~
#include"tch.h"
#define send(x, y, n); {{int k; for(k=0; k
www.eeworm.com/read/286908/8737943
c tch.c
#include"tch.h"
#define send(x, y, n); {{int k; for(k=0; k