%冒泡法 输出一串
function y=bubsort(x);
%A=[1 3 5 6 7 10 20 3 6 8];
r=length(x);
for i=1:r-1
for j=i+1:r
if x(i)>x(j)
t=x(j);
x(j)=x(i);
x(i)=t;
end
end
end
y=x;
>> A
A =
1 2 9 8 7 6 5 4 3
>> y=bubsort(A)
y =
1 2 3 4 5 6 7 8 9