代码搜索：while

找到约 10,000 项符合「while」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/492896/6411835

txt kmp算法.txt

void getnext(char t[],int next[]) { //求模式t的next值并存入next数组中 int i,j; i=1,j=0; next[1]=0; while(i
·
www.eeworm.com/read/492896/6411841

txt 大数最大公约数_200612119046.txt

#include #include #define N 101 int compare(char * c1,int s1,int e1,char *c2,int s2,int e2)/*大整数比较大小*/ { while(c1[s1]=='0'&&s1
·
www.eeworm.com/read/492901/6412410

cpp qcksrt.cpp

void qcksrt(int n, double arr[]) { int m = 7; int nstack = 50; int fm = 7875; int fa = 211; int fc = 1663; double a,fmi = 0.00012698413; int istack[51]; int jstack = 0; int i,j,
·
www.eeworm.com/read/492901/6412412

cpp sort2.cpp

void sort2(int n, double ra[], double rb[]) { int l,ir,i,j; double rra,rrb; l = n / 2 + 1; ir = n; do { if (l > 1) { l = l - 1; rra = ra[l];
·
www.eeworm.com/read/492901/6412415

cpp indexx.cpp

void indexx(int n, double arrin[], int indx[]) { int i,j,l,ir,indxt; double q; for (j = 1; j
·
www.eeworm.com/read/492901/6412418

cpp sort.cpp

void sort(int n, double ra[]) { int i,j,l,ir; double rra; l = int(n / 2) + 1; ir = n; do { if (l > 1) { l = l - 1; rra = ra[l]; }
·
www.eeworm.com/read/492904/6413388

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/492904/6413402

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/492904/6413441

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/492904/6413442

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
·