Временная сложность алгоритма

program bubble; 
const n=4;
var A:array [1..n, 1..n] of integer; 
i,j,tmp:integer;
t:boolean;  
begin 
randomize; 
writeln('Произвольный массив:'); 
for i:=1 to n do 
begin; 
for j:=1 to n do 
begin;
A[i,j]:=random(10); 
write(A[i,j],' '); 
end; 
writeln; 
end; 
for i:=1 to n do 
begin 
t:=true; 
while t do 
begin 
t:=false; 
for j:=1 to n-1 do 
if A[i,j]>A[i,j+1] then 
begin 
tmp:=A[i,j]; 
A[i,j]:=A[i,j+1]; 
A[i,j+1]:=tmp; 
t:=true; 
end; 
end; 
end;
writeln; 
writeln('Отсортированный массив:'); 
for i:=1 to n do 
begin 
for j:=1 to n do 
write(A[i,j],' '); 
writeln; 
end; 
end.

program vubor;
const n=4;
m=4;
var a: array[1..n,1..m] of integer;
a1: array[1..n*m,0..2] of integer;
i,j,i1: integer;
t1,t2,t3: integer;
begin
randomize;
writeln('Произвольный массив:');
for i:=1 to n do 
begin
for j:=1 to m do 
begin
a[i,j]:=Random(10);
a1[(i-1)*m+j,0]:=a[i,j];
a1[(i-1)*m+j,1]:=i;
a1[(i-1)*m+j,2]:=j;
write(a[i,j],' ');
end;
writeln;
end;
writeln;
write('Отсортированный массив:');
for i:=1 to n*m-1 do 
begin
for j:=i+1 to n*m do 
begin
if (a1[i,0]>a1[j,0]) then 
begin
t1:=a1[i,0]; 
t2:=a1[i,1]; 
t3:=a1[i,2];
a1[i]:=a1[j];
a1[j,0]:=t1; 
a1[j,1]:=t2; 
a1[j,2]:=t3;
end;
end;
end;
j:=0; i:=1;
for i1:=1 to n*m do 
begin
inc(j);
if j>m then 
begin
j:=1;
inc(i);
end;
a[i,j]:=a1[i1,0];
end;
writeln;
for i:=1 to n do 
begin
for j:=1 to m do 
begin
write(a[i,j],' ');
end;
writeln;
end;
end.

program vstavka;
const n=4;
var A:array [1..n] of integer;
i,k,temp,nom: integer;
begin
randomize;
write('Произвольный массив:');
writeln;
for i:=1 to n do
A[i]:=random(10);
for i:=1 to n do
write(A[i],' ');
for i:=1 to n-1 do
begin
nom:=i+1;
temp:=A[nom];
for k:=i+1 downto 2 do
begin
if (temp<A[k-1]) then
begin
A[k]:=A[k-1];
nom:=k-1;
end;
end;
A[nom]:=temp;
end;
writeln;
writeln;
writeln('Отсортированный массив:');
for i:=1 to n do 
write(A[i], ' '); 
end.