#  Pseudo-code
#
#    for k from 1 to n-m do
#       (1) find the largest entry among
#              a[m],a[m+1],...,a[n-m-k+2]
#       (2)  swap that entry with a[n-m-k+2]
#    end do
#
sortasc:=proc(m,n,a)
   local i, j, k, maxid, s;

   for k from 1 to n-m do
 
     # step (1)
     maxid:=m;
     for j from m+1 to n-k+1 do
         if evalf(a[j]) > evalf(a[maxid]) then
            maxid:=j;
         fi;
     od;

     # step (2)
     s:=a[maxid];
     a[maxid]:=a[n-k+1];
     a[n-k+1]:=s;

   od;

   print(` `);

end;