function [ A ] = insertSort( A )
%UNTITLED4 Summary of this function goes here
% Detailed explanation goes here
[m,n]=size(A);
for j=2:n
temp=A(j);
i=j-1;
while i>0&&temp<A(i)
A(i+1)=A(i);
i=i-1;
end
A(i+1)=temp;
end
end
%UNTITLED4 Summary of this function goes here
% Detailed explanation goes here
[m,n]=size(A);
for j=2:n
temp=A(j);
i=j-1;
while i>0&&temp<A(i)
A(i+1)=A(i);
i=i-1;
end
A(i+1)=temp;
end
end