Сортировка элементов матрицы по возрастанию - Pascal - Ответ 8693873

const n=5;
m=5;
var a:array [1..n,1..m] of integer;
i,j,k,b:integer;
begin
randomize;
k:=0;
 
for i:=1 to n do
for j:=1 to m do 
   a[i,j]:=random(12)+12;
 
for b:=1 to n do
    for i:=1 to n do
    for j:=1 to m-1 do
        if a[i,j]>a[i,j+1] then begin
           k:=a[i,j]; a[i,j]:=a[i,j+1]; a[i,j+1]:=k; end;
for b:=1 to n do
    for i:=2 to n do
    for j:=1 to m-1 do
        if a[i,j]>a[i,j+1] then begin
           k:=a[i,j]; a[i,j]:=a[i,j+1]; a[i,j+1]:=k; end;
for b:=1 to n do
    for i:=3 to n do
    for j:=1 to m-1 do
        if a[i,j]>a[i,j+1] then begin
           k:=a[i,j]; a[i,j]:=a[i,j+1]; a[i,j+1]:=k; end;
for b:=1 to n do
    for i:=4 to n do
    for j:=1 to m-1 do
        if a[i,j]>a[i,j+1] then begin
           k:=a[i,j]; a[i,j]:=a[i,j+1]; a[i,j+1]:=k; end;
for b:=1 to n do
    for i:=5 to n do
    for j:=1 to m-1 do
        if a[i,j]>a[i,j+1] then begin
           k:=a[i,j]; a[i,j]:=a[i,j+1]; a[i,j+1]:=k; end;
for i:=1 to n do begin
for j:=1 to m do 
    write (' ',a[i,j]);
    writeln; end;
end.