Procedure InsertionSort(var v:vetor;tam:integer);
var
   i,j,x : integer;
begin
   for i := 2 to tam do
   begin
      x := v[i];
      j := i;
      while (x < v[j-1]) AND (j > 1)do
      begin
         v[j] := v[j-1];
         dec(j);
      end;
      v[j] := x;
   end;
end;