代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/366495/9811637
cpp algo6-1.cpp
// algo6-1.cpp 求赫夫曼编码。实现算法6.12的程序
#include"c1.h"
#include"c6-7.h"
int min(HuffmanTree t,int i)
{ // 函数void select()调用
int j,flag;
unsigned int k=UINT_MAX; // 取k为不小于可能的值
for(j=1;
www.eeworm.com/read/366308/9821415
cpp k-means.cpp
//20061000404 叶亮 软件一班 k-means程序的完善
#include
#include
#define TRUE 1
#define FALSE 0
int N;
int K;
int * CenterIndex;
double * Center;
double * Ce
www.eeworm.com/read/169721/9845033
c dynamic.c
# include
# include
# define NUM 10
int main()
{
char *str[NUM]; /* 定义一个字符性的指针数组 */
int t;
/* 为数组中的每个指针分配内存 */
for(t=0; t
www.eeworm.com/read/169721/9845086
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/169721/9845099
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/365783/9847445
c checker.c
#include
#include
int main()
{
char *ptr = (char *) malloc(1024);
char ch;
/* Uninitialized read */
ch = ptr[0];
/* Write beyond the block */
ptr[1024]
www.eeworm.com/read/365033/9881272
c edit11.c
create(int n){
int i,j,s,d,k,m;
struct node *p;
for(i=0;i
www.eeworm.com/read/364227/9918018
cpp 双向栈.cpp
#include
#include
using namespace std;
void main()
{
int *array,*p; //定义数组
int i=0,j=0;
int m,k;
cout
www.eeworm.com/read/364100/9921976
c powell.c
#include "hjfgf.c"
double oneoptim(double x0[],double s[],double h0,double epsg,int n,double x[])
{double *a,*b,ff;
a=(double *)malloc(n*sizeof(double));
b=(double *)malloc(n*sizeof(double));
www.eeworm.com/read/363017/9971487
c conversions.c
/*
*
* GWIC
*
* (c) Joonas Lehtinen (jole@jole.fi), TUCS, 1998
*
* modification for rgb2yuv & yuv2rgb
* for color model YUV422 by Sasha Chukov
*
*/
#include "gwic.h"
/* Convert and round fl