代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/350189/10760285
cpp quicksort.cpp
#include
#include
#include
#define NUM 20
using namespace std;
cmp(const void *a, const void *b)
{
if(*(int *)a>*(int *)b) return 1;
else if(*(int *)a==*(int *
www.eeworm.com/read/421000/10761403
cpp qs.cpp
#include
#include
template
void QuickSort(Type a[],int p,int r)
{
if(p
www.eeworm.com/read/420999/10761658
c sup sound.c
#include
#define uchar unsigned char
void main()
{
EA=1;
IT0=1;
ET0=0;
while(1)
{
uchar i;
INT1=1;
i=0;
for(i;i
www.eeworm.com/read/420999/10761753
c beerflash.c
#include
uchar x;
sbit beer=P2^4;
sbit flash=P1^2;
void main()
{
while(1)
{
beer=~beer;
for(x=500;x>>0;x--);
for(x=500;x>>0;x--);
}
}
www.eeworm.com/read/276015/10775264
m psojisuankekaodunewmodify.m
function R=PSOjisuankekaodunewmodify(R)
% R=num+3
kekaodu=R(1)*R(4)+R(2)*R(5)+R(2)*R(3)*R(4)+R(1)*R(3)*R(5)+2*R(1)*R(2)*R(3)*R(4)*R(5)...
-R(2)*R(3)*R(4)*R(5)-R(1)*R(3)*R(4)*R(5)-R(1)*R(2)*R(4)
www.eeworm.com/read/349903/10785504
cpp brent.cpp
/*
* Program to factor big numbers using Brent-Pollard method.
* See "An Improved Monte Carlo Factorization Algorithm"
* by Richard Brent in BIT Vol. 20 1980 pp 176-184
*
* Requires:
www.eeworm.com/read/349903/10786140
c mex.c
/* mex.c
*
* Updated to allow emission of scheduled code.
*
* Macro EXpansion program.
* Expands Macros from a .mcs file into a .tpl file to create a .c file
*
* Copyright (c) 2002 Sha
www.eeworm.com/read/275837/10792681
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/275837/10792718
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/275837/10792820
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