代码搜索：else
找到约 10,000 项符合「else」的源代码
代码结果 10,000
www.eeworm.com/read/196808/8059285
m untitled17.m
result=zeros(25,3);
for i=1:9;
if i==1;
result(1,1)=disp(i);
else
result(i,1)=disp(i*3-2);
end
if i==1;
result(1,2)=disp(2);
else
result(i
www.eeworm.com/read/295931/8132967
c 16rbsh.c
int rbsh(p,n,a,b,m)
int n,*m;
double a,b,p[];
{ int i,j,k;
i=1; j=n;
while (i=a)&&(p[k-1]
www.eeworm.com/read/195741/8133078
bak 折半查找.bak
clear
dime a(10)
n=10
for i=1 to 10
a(i)=int(rand()*100)
??a(i)
next
*排序
for i=1 to n-1
for j=n to i+1 step -1
if a(j)
www.eeworm.com/read/195741/8133122
prg 折半查找.prg
clear
dime a(10)
n=10
for i=1 to 10
a(i)=int(rand()*100)
??a(i)
next
*排序
for i=1 to n-1
for j=n to i+1 step -1
if a(j)
www.eeworm.com/read/246404/12727356
pas ac1139.pas
program tju1139;
const
maxstate=1062599;
var
c:array[0..24,0..4]of longint;
a:array[0..5]of byte;
q:array[-1..maxstate]of longint;
step:array[-1..maxstate]of shortint;
n,t,i,j,k,x,
www.eeworm.com/read/246404/12727830
pas ac1139.pas
program tju1139;
const
maxstate=1062599;
var
c:array[0..24,0..4]of longint;
a:array[0..5]of byte;
q:array[-1..maxstate]of longint;
step:array[-1..maxstate]of shortint;
n,t,i,j,k,x,
www.eeworm.com/read/145256/12741460
c getopt.c
/* Getopt for GNU.
NOTE: getopt is now part of the C library, so if you don't know what
"Keep this file name-space clean" means, talk to drepper@gnu.org
before changing it!
Copyright (C)
www.eeworm.com/read/145241/12743903
txt ch8_7.txt
int sift(JD r[],int k,int m)
{ int i,j;
JD x;
i=k; x=r[i]; j=2*i;
while(jr[j].key)
{ r[i]=r[j];
i=j;