代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/432144/8624108
c 16.4 实数按关键字成员有序的结构体数组的对分查找 rbkey.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/432144/8624170
c 16.4 字符按关键字成员有序的结构体数组的对分查找 cbkey.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/432144/8624583
c 8.5 埃尔米特逐步插值 atk.c
#include "math.h"
double atk(x,y,n,t,eps)
int n;
double t,eps,x[],y[];
{ int i,j,k,m,l;
double z,xx[10],yy[10];
z=0.0;
if (n
www.eeworm.com/read/432144/8624642
c 15.5 字符结构排序 ckey.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/432144/8624686
c 15.1 字符串冒泡排序 hbub.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/432144/8624691
c 15.5 整数结构排序 ikey.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/432144/8624957
c 3.3 产生任意区间内均匀分布的一个随机整数 rab1.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/388163/8631372
c text1.c
#include"reg51.h"
main()
{while(1)
{
P0=0XC0;
P2=0X00;}}
www.eeworm.com/read/388092/8636302
m perceptron_class1.m
p=[1 -1 -1
1 1 -1]';
t=[0 1];
w=(rand(1,3)-0.5)*2;
b=(rand(1,1)-0.5)*2;
%w=[0.5 -1 -0.5];b=0.5;
% for j=1:1:10
e=1;j=0;
while abs(e)>1.0e-6
for i=1:1:2
y=w*p(:,i)+b;
a=hardlim(y);
e=t
www.eeworm.com/read/431812/8652413
cpp pku2126.cpp
int main()
{
int n,a[100],i;
while(scanf("%d",&n)!=-1)
{
for(i=0;i