7urin9'Blog

function count = andian(a) v = max(a,[],2); count = 0; for i=1:length(v) [r2,c2] = find(a==v(i)); mi = min(a(:,c2)); if(v(i) == mi) count = v(i); end end end

function [m,n] = stamatrix(a) %网上找到的方法，感觉很巧妙 x=a(:); x=sort(x); d=diff([x;max(x)+1]); count = diff(find([1;d]));%列出每个元素出现的个数 m = x(find(d));%列出a中出现的元素 n = count; endclc; clear; a = [1:4;5:8;2 1 2 2;2

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);

最大公约数：

求矩阵的模：