function a_ed = arraysort(a)
%冒泡排序法
for i =1:length(a)-1%进行多少次比较for j=1+i:length(a)%每次求出最大的数，放在最后if(a(j)<a(i))tem = a(i);a(i) = a(j);a(j) = tem;endenda_ed = a;
end
clc;
clear;
a = [2 4 4 6 14 0 2 8 4 1 9 4]
b = arraysort(a)转载于:https://www.cnblogs.com/KongkOngL/p/4074437.html
