代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/469238/6979674
cpp maze.cpp
#include
#include
#include
#define N 9
void bl(int **a,int i,int j);
void tl(int **a,int i,int j);
void dy(int **a,int i,int j);
void main()
{ int hang,lie,**ufo,
www.eeworm.com/read/469287/6980139
txt 黄金分割.txt
#include "hjfgf.c"
main()
{double xx[1],a[1],b[1],ff;
double s[]={1},x0[]={0};
jtf(x0,0.1,s,1,a,b);
ff=gold(a,b,0.00001,1,xx);
printf("\nx[0]=%f,,ff=%f",xx[0],ff);
getch();
}
#include "
www.eeworm.com/read/467320/7009659
cpp 1.cpp
#include
#include
#include
#include
#define TRUE 1
#define FALSE 0
int N; //数据个数
int K; //集合个数
int * CenterIndex; //初始化质心数组的索引
float * Ce
www.eeworm.com/read/467436/7012477
h elr2.h
#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/467441/7012726
h rkt1.h
#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/466955/7024838
c algo6-1.c
/* algo6-1.c 求赫夫曼编码。实现算法6.12的程序 */
#include"c1.h"
#include"c6-7.h"
int min1(HuffmanTree t,int i)
{ /* 函数void select()调用 */
int j,flag;
unsigned int k=UINT_MAX; /* 取k为不小于可能的值 */
www.eeworm.com/read/465459/7055203
txt fft.txt
/****************************************************
FFT()
参数：
TD为时域值
FD为频域值
power为2的幂数
返回值：
无
说明：
本函数实现快速傅立叶变换
***************************************************
www.eeworm.com/read/464613/7066429
cpp utilstuff.cpp
/***************************************************************************
utilstuff.cpp - description
-------------------
begin
www.eeworm.com/read/269381/7085360
c zhaoshiwei.c
#include
#include
#include
#include
#define N 50
#define M 500
char *a[34]={"auto","break","case","char","const","continue","default","do",
www.eeworm.com/read/219035/7147270
m test02.m
a=malloc;
tic;
for i=1:10000;
b=malloc;
b.next=a;
b.data=rand(1);
a=b;
end;
toc,
b=a.next;
while b~= 0,
free(a);
a=b;
end