代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/197852/7965596
c 44blib.c
#include
#include
#include
#include
#include
#include "..\target\44b.h"
#include "..\target\44blib.h"
#include "..\target\def.h"
#inclu
www.eeworm.com/read/298187/7971278
java d7r9f.java
public class d7r9F
{
void qcksrt(int n, double arr[])
{
int m = 7; int nstack = 50; int fm = 7875; int fa = 211;
int fc = 1663; double a, fmi = 0.00012698413;
www.eeworm.com/read/298099/7974602
m ex0510.m
%Ex0510 用continue终止while循环
sum=2;ss=0;
for n=3:100
for m=2:fix(sqrt(n))
if mod(n,m)==0
ss=1;%能被整除就用ss为1表示
break;%能被整除就跳出判断的循环
else
www.eeworm.com/read/197671/7979357
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/197671/7979383
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/197671/7979461
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/197671/7979463
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/197671/7979935
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/197671/7979947
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/197671/7979986
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