代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/161837/10366515
cpp seqsearch.cpp
int SeqSearch1(int r[], int n, int k){
r[0]=k ; //设置哨兵
int i=n;
while (r[i]!=k) //若r[i]与k相等，则返回当前i的值;否则继续比较前一个记录;
i--;
return i;
}
www.eeworm.com/read/354109/10388812
cpp graph3.cpp
//图的运算的实现文件graph3.cpp
#include"graph3.h"
//构造函数,初始化图的邻接矩阵与边集数组
adjMList::adjMList(RCW GE[],int n,int e)
{int i,j;
for(i=0; i
www.eeworm.com/read/354040/10395057
m assignment.m
clear;
N=100;
M=100;
for i=1:N
x(i)=rand(1)*M;
y(i)=rand(1)*M;
end
x(1)=M*0.95;y(1)=M*0.95;
plot(x,y,'o',x(1),y(1),'*');
neighbour=zeros(N,N*0.2);
for i=1:N
n(i)=1;
for j=1:
www.eeworm.com/read/354040/10395225
asv assignment.asv
clear;
N=100;
M=100;
for i=1:N
x(i)=rand(1)*M;
y(i)=rand(1)*M;
end
x(1)=M*0.95;y(1)=M*0.95;
plot(x,y,'o',x(1),y(1),'*');
neighbour=zeros(N,N*0.2);
for i=1:N
n(i)=1;
for j=1:
www.eeworm.com/read/354040/10395420
m temp2.m
clear;
N=100;
M=100;
for i=1:N
x(i)=rand(1)*M;
y(i)=rand(1)*M;
end
x(1)=M*0.95;y(1)=M*0.95;
plot(x,y,'o',x(1),y(1),'*');
neighbour=zeros(N,N*0.2);
for i=1:N
n(i)=1;
for j=1:
www.eeworm.com/read/354040/10395493
asv temp2.asv
clear;
N=100;
M=100;
for i=1:N
x(i)=rand(1)*M;
y(i)=rand(1)*M;
end
x(1)=M*0.95;y(1)=M*0.95;
plot(x,y,'o',x(1),y(1),'*');
neighbour=zeros(N,N*0.2);
for i=1:N
n(i)=1;
for j=1:
www.eeworm.com/read/354019/10396351
m newp11.m
%%感知器算法实现逻辑与
W0=zeros(1,3);x=zeros(4,3);%x 为增广矩阵
x(1,:)=[0 0 1];
x(2,:)=[0 1 1];
x(3,:)=[1 0 1];
x(4,:)=[-1 -1 -1];
N=4;
Gx=0;Gx=zeros(1,3);
M=0;
W=zeros(5,3);
while (1)
W(1,:)=W0;
www.eeworm.com/read/353894/10407705
-
/*原题： 一寝室有15个人，每天都要三人一行外出散步一次，要在一周
（7天）内 每个人都跟其他14人各散步一次，问每一天应该怎么安排？？
要快点想哟！！！！ 都等一会15分钟*/
#include
int anpai[7][5][3];
int biaozhi[16][16];
int i=0,j=0,k=0,a,total=0;
void hui
www.eeworm.com/read/279474/10434922
cpp 数字游戏.cpp
#include
using namespace std;
#include
int main()
{
int m,i,flag=0,a[20],b[20],aflag,p=0,k;
while(cin>>m)
{
i=1;
flag=0;
aflag=0;
if(m==0)
break;
k=sqrt(m