代码搜索：else
找到约 10,000 项符合「else」的源代码
代码结果 10,000
www.eeworm.com/read/261198/11659495
m factorial.m
function x = factorial(n)
% FACTORIAL Compute n!
% x = factorial(n)
if n == 0
x = 1;
else
x = n*factorial(n-1);
end
www.eeworm.com/read/157814/11661874
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;
www.eeworm.com/read/260947/11685223
cpp 2_9.cpp
#include
void main()
{
int x,j=0;
do
{
coutx;
if ((x%3==0) && (x%5==0) && (x%7==0))
cout
www.eeworm.com/read/157511/11698031
pl test2.pl
var a,b,c;
begin
read(a,b,c);
if a>0 then write(b) else write(c);
write(a,b,c);
end.
www.eeworm.com/read/345494/11813287
m mytestnio.m
function [y1,y2]=mytestnio(x1,x2)
if nargin==1
y1=x1;
if nargout==2
y2=x1;
end
else
if nargout==1
y1=x1+x2;
else
y1=x1;
y2=x2;
end
www.eeworm.com/read/154972/11908950
move-if-change
#!/bin/sh
# Like mv $1 $2, but if the files are the same, just delete $1.
# Status is 0 if $2 is changed, 1 otherwise.
if test -r $2; then
if cmp -s $1 $2; then
echo $2 is unchanged
rm -f $1
www.eeworm.com/read/257010/11961029
m routh.m
% Function routh(a) constructs the Routh table for a polynomial of degree n
% Hadi Saadat, 1998
function routh(a)
head=[' '
' Routh-Hurwitz Array '
'
www.eeworm.com/read/254541/12131086
m thomas2.m
function[U]=Thomas2(A,B,R,D)
n=length(B);
for i=1:n
for j=1:n
if i==j
X(i,j)=B(1,i);
else if i==j+1
X(i,j)=A(1,j);
else if i==j-1
www.eeworm.com/read/151847/12169515
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]