代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/458870/7286344
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/458870/7286354
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/458870/7286369
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/458870/7286397
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/458870/7286605
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/458870/7286613
c 15hbub.c
#include "string.h"
void hbub(p,n,k,m)
char *p[];
int k,m,n;
{ int j,i;
char *d;
if (kn-1) m=n-1;
while (k
www.eeworm.com/read/458870/7286614
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/458870/7286647
c 3rab1.c
int rab1(a,b,r)
int a,b,*r;
{ int k,l,m,i,p;
k=b-a+1; l=2;
while (l
www.eeworm.com/read/458538/7294780
m repair.m
%repair 修改超重的问题解，即选择的物品重量不能超过限重C
overfiled=0;%不超重
for j=1:n
if sum(x(j,:)*w')>C %超重
overfiled=1;%超重符号
end
while overfiled
k=fix(1+rand()*(m-1));%选择其
www.eeworm.com/read/458508/7295315
pas shell.pas
Procedure ShellSort ();
var d, i, t : integer;
k : boolean; { пpизнак пеpестановки }
begin
d:=N div 2; { начальное значение интеpвала }
while d > 0 do begin { цикл с yменьшением инт