代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/275837/10793128
c 10wity.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/275837/10793132
c 10gil.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/275837/10793322
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/275837/10793331
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/275837/10793505
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/275837/10793527
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/349890/10794452
c denoise.c
#include "f2407_c.h"
#include "stdlib.h"
#include "stdio.h"
#include "wavelet_signal.h"
#include "math.h"
#define N0 64
double g0[8]={0.230378,0.714847, 0.630881, -0.027984 ,-0.187035, 0.0
www.eeworm.com/read/349837/10797551
cpp algo0612.cpp
void HuffmanCoding(HuffmanTree &HT, HuffmanCode &HC, int *w, int n) {
// 算法6.12
// w存放n个字符的权值(均>0)，构造哈夫曼树HT，
// 并求出n个字符的哈夫曼编码HC
int i, j, m, s1, s2, start;
char *cd;
unsigned int c,
www.eeworm.com/read/420375/10798623
c matrix.c
/*
This is modified code from the internet
After adjusting the memory allocation, I was able to run it under whale
OpenMP implementation of matrix multiplication.
*/
#include
www.eeworm.com/read/349685/10804635
txt yuesefuhuan.txt
#include
#include
typedef struct LNode
{
int num,pwd;
struct LNode *next;
}LNode, *LinkList;
void main()
{
int a,i,m,n,j;//m为报数上限值，n为人数，j为输入的密码；
cout