代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/391333/8408425
cpp powell.cpp
/*本程序包含5个C文件: mpowell.c, powell.c,
funct.c(目标函数), jtf.c(进退法), hjfgf.c(黄金分割法)*/
//题目 y=x1*x1+x2*x2-x1*x2-10*x1-4*x2+60
//#include "powell.c"
#include "stdio.h"
#include "stdlib.h"
#include "ma
www.eeworm.com/read/191861/8419187
h graph4.h
//图类结构体定义与相关操作graph4.h
typedef struct
{char *data;
int *visited;
float **edge;
int max,size;
}Graph;
//初始化图
void SetGraph(Graph *G,int n)
{int i,j;
G->data=new char[n];
G->visited=new
www.eeworm.com/read/191860/8419341
h graph4.h
//图类结构体定义与相关操作graph4.h
typedef struct
{char *data;
int *visited;
float **edge;
int max,size;
}Graph;
//初始化图
void SetGraph(Graph *G,int n)
{int i,j;
G->data=new char[n];
G->visited=new
www.eeworm.com/read/191798/8422128
cpp huffman1.cpp
//赫夫曼树与赫夫曼编码
//Huffman1.cpp
#include
#include
const int MaxV=100;//初始设定的最大权值
const int MaxBit=15;//初始设定的最大编码位数
const int MaxN=15;//初始设定的最大结点数
//赫夫曼树的结点结构
typedef struct
www.eeworm.com/read/191798/8422143
txt huffman1.txt
//赫夫曼树与赫夫曼编码
//Huffman1.cpp
#include
#include
const int MaxV=100;//初始设定的最大权值
const int MaxBit=15;//初始设定的最大编码位数
const int MaxN=15;//初始设定的最大结点数
//赫夫曼树的结点结构
typedef struct
www.eeworm.com/read/191620/8425673
h graph4.h
//图类结构体定义与相关操作graph4.h
typedef struct
{char *data;
int *visited;
float **edge;
int max,size;
}Graph;
//初始化图
void SetGraph(Graph *G,int n)
{int i,j;
G->data=new char[n];
G->visited=new
www.eeworm.com/read/189271/8481435
cpp lex.cpp
#include
#include
#include
#include
#include
#define N 50
#define M 500
char *a[32]={"auto","break","case","char","const","continue","defau
www.eeworm.com/read/189141/8489442
cpp aa.cpp
// aa.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include
#include
#include
#include
void
printarray (in
www.eeworm.com/read/290325/8489856
c dlmalloc.c
/*
This is a version (aka dlmalloc) of malloc/free/realloc written by
Doug Lea and released to the public domain. Use, modify, and
redistribute this code without permission or acknowledgement i
www.eeworm.com/read/290293/8491498
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