num=1;
switch num
case 1
data='Monday'
case 2
data='Tuesday'
case 3
data='Wednesday'
case 4
data='Thuesday'
case 5
data='Friday'
case 6
data='Saturday'
case 7
data='Sunday'
otherwise
data='None!!!'
end
//case与后面的value之间需要空格
求任意底数的对数函数值y=lognx
clear
n=input('Enter the valuue of "n":');
x=input('Enter the valuue of "x":');
switch(n)
case 1
errordlg('出错');//errordlg弹出错误对话框
case 2
y=log2(x);
case exp(1)//exp(x)表示的是e的x次方
y=log(x);
case 10
y=log10(x);
otherwise
y=log(x)/log10(n);
end
disp(y)
try-match结构
Num = 6;
Mat = magic(4)%生成一个4*4的矩阵
try
Mat_Num = Mat(Num,:)%取Mat的第Num行元素
catch
Mat_end = Mat(end,:)%若Mat没有第Mat行元素,则取最后一行元素
end
lasterr %显示出错原因
for-循环结构
计算整数1-100的和
sum = 0;
for i = 1:1:100
sum = sum + i;
end
sum
创建对称矩阵
for i = 1:4
for j=1:4
if i>(5-j)
else
Mat(i,j) = i+j-1;
end
end
end
Mat
利用for循环求解x=sin(nkpi/360),n属于1-10,k属于1-4
x = [];
for n=1:1:10
for k=1:1:4
x(n,k) = sin((n*k*pi)/360);
end
end
x
while结构
fibonacci数列中第一个大于9999的元素
a(1)=1;
a(2)=1;
i=2;
while a(i)<10000
a(i+1)=a(i)+a(i-1);
i=i+1;
end
[i a(i)]
求整数1-100的和
i=1;
sum=0;
while i<101
sum=sum+i;
i=i+1;
end
sum