代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/383734/8922577
txt 算法.txt
求两个数的的公约数：
while n≠0 do
r=m mod n
m=n
n=r
return m
顺序查找
sequentiasearch(A[0...n-1],k)
i=0
while i
www.eeworm.com/read/383605/8932845
txt 折半排序.txt
void binsort(JD r[],int n) //折半排序
{ int i,j,x,s,m,k;
for(i=2;i
www.eeworm.com/read/427573/8934505
c 8atk.c
#include "math.h"
double atk(x,y,n,t,eps)
int n;
double t,eps,x[],y[];
{ int i,j,k,m,l;
double z,xx[10],yy[10];
z=0.0;
if (n
www.eeworm.com/read/427573/8934718
c 15ikey.c
void ikey(p,n,k,m)
int n,k,m;
HEAPSORT *p[];
{ int i,l;
HEAPSORT *w;
void pisift();
if (kn-1) m=n-1;
l=m-k+1;
for (i=l/2-1; i>=0; i--)
www.eeworm.com/read/427573/8934742
c 15ckey.c
void ckey(p,n,k,m)
int n,k,m;
HEAPSORT *p[];
{ int i,l;
HEAPSORT *w;
void pcsift();
if (kn-1) m=n-1;
l=m-k+1;
for (i=l/2-1; i>=0; i--)
www.eeworm.com/read/427573/8934750
c 16cbkey.c
int cbkey(p,n,a,b,m)
int n,*m;
BISERCH *p[];
char a,b;
{ int i,j,k;
i=1; j=n;
while (i=a)&&((*p[k-1]).KEY
www.eeworm.com/read/427573/8934802
c 16rbkey.c
int rbkey(p,n,a,b,m)
int n,*m;
BISERCH *p[];
double a,b;
{ int i,j,k;
i=1; j=n;
while (i=a)&&((*p[k-1]).KEY
www.eeworm.com/read/427573/8934876
c 12cplx.c
#include "stdlib.h"
int cplx(n,m,a,b,alpha,eps,x,xx,k,s,f)
int n,m,k;
void (*s)();
double a[],b[],alpha,eps,x[],xx[],(*f)();
{ double rn(double *);
int r,g,i,j,it,kt,jt,kk;
www.eeworm.com/read/427573/8934997
c 5sstq.c
#include "stdio.h"
#include "math.h"
int sstq(n,b,c,q,eps,l)
int n,l;
double b[],c[],q[],eps;
{ int i,j,k,m,it,u,v;
double d,f,h,g,p,r,e,s;
c[n-1]=0.0; d=0.0; f=0.0;
www.eeworm.com/read/427573/8935764
c 15ikey.c
void ikey(p,n,k,m)
int n,k,m;
HEAPSORT *p[];
{ int i,l;
HEAPSORT *w;
void pisift();
if (kn-1) m=n-1;
l=m-k+1;
for (i=l/2-1; i>=0; i--)