代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/289577/8542607
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/188407/8542764
h matrix_op.h
#include"stdio.h"
#include"time.h"
double Surplus(double A[],int m,int n) /*求矩阵行列式*/
{
int i,j,k,p,r;
double X,temp=1,temp1=1,s=0,s1=0;
if(n==2)
{for(i=0;i
www.eeworm.com/read/288969/8589747
txt k均值c原代码.txt
#include
#include
#include ;
#include
#define TRUE 1
#define FALSE 0
int N;//数据个数
int K;//集合个数
int * CenterIndex;//初始化质心数组的索引
doub
www.eeworm.com/read/388340/8614042
txt kmeans.txt
//k-均值聚类算法C语言版
＃i nclude
＃i nclude
#define TRUE 1
#define FALSE 0
int N;//数据个数
int K;//集合个数
int * CenterIndex;//初始化质心数组的索引
double * Center;//质心集合
www.eeworm.com/read/432144/8623600
c 13.5 离散随机线性系统的卡尔曼滤波 lman.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/432144/8623656
c 7.9 求解非线性方程组一组实根的拟牛顿法 netn.c
#include "stdlib.h"
#include "math.h"
#include "stdio.h"
#include "6gaus.c"
int netn(n,eps,t,h,x,k,f)
int n,k;
void (*f)();
double eps,t,h,x[];
{
int i,j,l;
double am,z,beta,d,*y,*a,
www.eeworm.com/read/432144/8623673
c 7.10 求解非线性方程组最小二乘解的广义逆法 ngin.c
#include "math.h"
#include "stdlib.h"
#include "6gmiv.c"
int ngin(m,n,eps1,eps2,x,ka,f,s)
void (*f)(),(*s)();
int m,n,ka;
double eps1,eps2,x[];
{
int i,j,k,l,kk,jt;
double y[10],b[10]
www.eeworm.com/read/432144/8623703
c 12.3 不等式约束线性规划问题 lplq.c
#include "stdlib.h"
#include "4rinv.c"
#include "4trmul.c"
int lplq(a,b,c,m,n,x)
int m,n;
double a[],b[],c[],x[];
{ int i,mn,k,j,l,*js;
double s,z,dd,y,*p,*d;
js=mall
www.eeworm.com/read/432144/8623863
c 6.15 求解病态方程组 bint.c
#include "4trmul.c"
#include "6gaus.c"
#include "stdlib.h"
#include "math.h"
#include "stdio.h"
int bint(a,n,b,eps,x)
int n;
double a[],b[],x[],eps;
{
int i,j,k,kk;
double *p,*r,*e,q
www.eeworm.com/read/432144/8623869
c 6.13 求解线性最小二乘问题的豪斯赫尔德变换法 gmqr.c
#include "4maqr.c"
#include "stdlib.h"
int gmqr(a,m,n,b,q)
int m,n;
double a[],b[],q[];
{
int i,j;
double d,*c;
int maqr(double [],int,int,double []);
c=malloc(n*sizeof(double