Sort n(2), more better than #2

Insertion Sort(Pascal) #1

var A:array [1..10] of integer;
key,u,i:integer;
begin
for i:=1 to 10 do
 A[i]:=random(10);
for i:=2 to 10 do
 begin
 key:=A[i];
  u:=i-1;
   while (u>0) and (A[u]>key) do
    begin
    A[u+1]:=A[u];
    u:=u-1;
    A[u+1]:=key;
    end;
  end;
end.