代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/323663/13328279
c 键盘.c
#include"reg52.h"
#include"intrins.h"
#define uchar unsigned char
#define uint unsigned int
void delay(uchar del);
uchar jzaj(void);
void ajcl(uchar jz);
void main()
{
u
www.eeworm.com/read/137335/13328301
c 12maxn.c
#include "math.h"
void maxn(x,n,eps,k,js,ff)
int n,k,js[];
double eps,x[],(*ff)();
{ int i,j,m,l,jt,il;
double y[10],b[10],p,z,t,h1,h2,f,dx;
js[0]=0; jt=1; h2=0.0;
while
www.eeworm.com/read/137335/13328304
c 12max1.c
#include "math.h"
void max1(x,eps,k,js,f)
void (*f)();
int k,js[2];
double eps,x[2];
{ int i,j,m,jt;
double xx,h1,h2,dx,y[10],b[10],z[2];
js[0]=0; jt=1; h2=0.0;
whil
www.eeworm.com/read/137335/13328807
c 7dhrt.c
#include "math.h"
int dhrt(a,b,h,eps,x,m,f)
int m;
double a,b,h,eps,x[],(*f)();
{ int n,js;
double z,y,z1,y1,z0,y0;
n=0; z=a; y=(*f)(z);
while ((z
www.eeworm.com/read/137335/13328940
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/137335/13328962
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/323663/13328991
c 1.c
#include
sbit p=P1^0;
void delay(void)
{
unsigned int i,j,k;
for(i=20;i>0;i--)
for(j=20;j>0;j--)
for(k=248;k>0;k--);
}
main()
{
while(1)
{
p=0;
delay();
www.eeworm.com/read/137335/13329028
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/323663/13329045
c 4.c
#include
unsigned char i;
unsigned char temp;
unsigned char a,b;
void delay(void)
{
unsigned char m,n,s;
for(m=20;m>0;m--)
for(n=20;n>0;n--)
for(s=248;s>0;s--);
}
void m
www.eeworm.com/read/137335/13329056
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);