代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/443020/7639328
m dajiama.m
function y=dajiama(a,b,n)
%产生伽马随机分布的数据，a、b为随机分布的参数，数据量为n
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
k=1;
if(a
www.eeworm.com/read/442972/7640748
c minhost.c
// minhost.c
#define BYTE unsigned char
// SL811 Registers
#define CTL 0x00 // write this register to kick off a transfer
#define BUFADR 0x01 // start of internal data buffer
#define BUFLEN 0
www.eeworm.com/read/442963/7640903
m longbeige.m
%龙贝格加速算法(课本71页表2-5)
function r=longbeige(a,b,n,e)
h=b-a;
if a==0
v=1;
else
v=f(a);
end
t1=h/2*(v+f(b))
for k=1:n
k
s=0;
x=a+h/2;
while x
www.eeworm.com/read/442885/7642748
cpp sor.cpp
#include "stdio.h"
#include "math.h"
double *x,*temp;
int Sor(int *a,int *b,int n,double w,double e)
{
int i,j,m=0;
double d,sum,max=e+1;
while(max>e)
{
for(i=0;i
www.eeworm.com/read/442831/7643919
c 16hbsh.c
#include "string.h"
int hbsh(p,n,a,b,m)
int n,*m;
char a[],b[],*p[];
{ int i,j,k;
i=1; j=n;
while (i=0)&&(strcmp(p[k-1
www.eeworm.com/read/442831/7644022
c 15cqck.c
#include "15cbub.c"
void cqck(p,n)
int n;
char p[];
{ int m,i0,*i;
char *s;
void csplit();
i=&i0;
if (n>10)
{ csplit(p,n,i);
m=i0;
cqck(p,m
www.eeworm.com/read/442831/7644028
c 15ihap.c
void ihap(p,n)
int n,p[];
{ int i,mm,t;
void isift();
mm=n/2;
for (i=mm-1; i>=0; i--)
isift(p,i,n-1);
for (i=n-1; i>=1; i--)
{ t=p[0]; p[0]=p[i]; p[i]=t;
www.eeworm.com/read/442831/7644045
c 15rhap.c
void rhap(p,n)
int n;
double p[];
{ int i,mm;
double t;
void rsift();
mm=n/2;
for (i=mm-1; i>=0; i--)
rsift(p,i,n-1);
for (i=n-1; i>=1; i--)
{ t=p[0
www.eeworm.com/read/442831/7644054
c 15iqck.c
#include "15ibub.c"
void iqck(p,n)
int n,p[];
{ int m,i0,*i,s0,*s;
void isplit();
i=&i0;
if (n>10)
{ isplit(p,n,i);
m=i0;
iqck(p,m);
s=p+(i0+1);
www.eeworm.com/read/442831/7644056
c 15rqck.c
#include "15rbub.c"
void rqck(p,n)
int n;
double p[];
{ int m,i0,*i;
double *s;
void rsplit();
i=&i0;
if (n>10)
{ rsplit(p,n,i);
m=i0;
rqck