代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/158531/11603490
pas t2003_4.pas
program t2003_4(input,output);{Epidemic Control}
const maxn=300;
type l_in=^in_node; {p lines of infect roads}
in_node=record
a,b:integer;
next:l_in;
end;
point
www.eeworm.com/read/262111/11605923
cpp bo4-3.cpp
// bo4-3.cpp 串采用块链存储结构(由c4-3.h定义)的基本操作(16个)
void InitString(LString &T)
{ // 初始化(产生空串)字符串T。另加
T.curlen=0;
T.head=NULL;
T.tail=NULL;
}
Status StrAssign(LString &T,char *chars)
www.eeworm.com/read/262111/11606515
c bo4-3.c
/* bo4-3.c 串采用块链存储结构(由c4-3.h定义)的基本操作(16个) */
void InitString(LString *T)
{ /* 初始化(产生空串)字符串T。另加 */
(*T).curlen=0;
(*T).head=NULL;
(*T).tail=NULL;
}
Status StrAssign(LString *T,ch
www.eeworm.com/read/262059/11608505
m romber.m
%龙贝格求积公式
function [R,quad,err,h]=romber(f,a,b,n,delta)
%f被积函数
%a，b是上下限
%n+1是T数表的列数
%delta是允许误差
%R是T的数表
%quad是所求的积分
M=1;
h=b-a;
err=1;
J=0;
R=zeros(4,4);
R(1,1)=h*(feval(f,a)+feval(f,b))/2
www.eeworm.com/read/158443/11614803
c balanc.c
#include
#define RADIX 2.0
void balanc(a,n)
float **a;
int n;
{
int last,j,i;
float s,r,g,f,c,sqrdx;
sqrdx=RADIX*RADIX;
last=0;
while (last == 0) {
last=1;
for (i=1;i
www.eeworm.com/read/158443/11615434
c hunt.c
void hunt(xx,n,x,jlo)
float x,xx[];
unsigned long *jlo,n;
{
unsigned long jm,jhi,inc;
int ascnd;
ascnd=(xx[n] >= xx[1]);
if (*jlo n) {
*jlo=0;
jhi=n+1;
} else {
www.eeworm.com/read/158443/11616080
c eclass.c
void eclass(nf,n,lista,listb,m)
int lista[],listb[],m,n,nf[];
{
int l,k,j;
for (k=1;k
www.eeworm.com/read/158443/11616508
c select.c
#define SWAP(a,b) temp=(a);(a)=(b);(b)=temp;
float select(k,n,arr)
float arr[];
unsigned long k,n;
{
unsigned long i,ir,j,l,mid;
float a,temp;
l=1;
ir=n;
for (;;) {
if (ir
www.eeworm.com/read/261866/11617999
c 3-1.c
#include
sbit P1_0=P1^0;
sbit P1_1=P1^1;
sbit P1_2=P1^2;
sbit P1_3=P1^3;
void Delay(void)
{
int i,j;
for(i=50;i>=0;i--)
{
for(j=50;j>=0;j--);
www.eeworm.com/read/348000/11619110
c da.c
#include
#include
#define uchar unsigned char
#define uint unsigned int
code unsigned char Sintab[128]={64,67,70,73,76,79,82,85,88,91,94,96,99,102,104,106,
109,111,113,115