代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/238879/13317214
lua sort.lua
-- two implementations of a sort function
-- this is an example only. Lua has now a built-in function "sort"
-- extracted from Programming Pearls, page 110
function qsort(x,l,u,f)
if l
www.eeworm.com/read/137520/13317255
m ex3_11.m
sum=0;
cnt=0;
val=input('Enter a number (end in 0):');
while (val~=0)
sum=sum+val;
cnt=cnt+1;
val=input('Enter a number (end in 0):');
end
if (cnt > 0)
sum
mean=sum/cn
www.eeworm.com/read/323775/13319574
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/323775/13319614
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/323775/13319711
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/323775/13319715
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/137489/13320151
pl t2a.pl
#!/usr/bin/perl
#
# Copyright 1994-1996 Werner Almesberger.
# All rights reserved.
#
# See file COPYING for details.
#
#-----------------------------------------------------------------------------
#
www.eeworm.com/read/323775/13320405
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/323775/13320421
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/323775/13320466
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