Отсортировать каждый нечетный столбец матрицы

program kokoko;
uses crt;
const N=10;
var
bf:integer;
B:array[1..N,1..N] of integer;
i, j, k:integer;
begin
writeln('Исходный массив');
randomize;
for i:=1 to N do
for j:=1 to N do B[i,j]:=random(100);
for i:=1 to N do
for j:=1 to N do begin
write(B[i,j]:4);
if j=N then writeln;
end;
for j:=1 to n do
if j mod 2 <> 0 then begin
for i:=1 to n-1 do
for k:=i+1 to n do
if B[i,j]<B[k,j] then
begin
bf:=B[i,j];
B[i,j]:=B[k,j];
B[k,j]:=bf;
end;
end;
writeln('Сортировка');
for i:=1 to n do
begin
for j:=1 to n do
write(B[i,j]:4);
writeln;
end;
writeln('Перемещение главной диагонали');
for i:=1 to N do
for j:=1 to N do begin
if i=j then begin
B[1,j]:=B[i,j];
B[10,j]:=B[i,j];
end;
end;
for i:=1 to n do
begin
for j:=1 to n do
// write(B[i,j]:4);
writeln;
end;
writeln;
end.

program kokoko;
const N=10;
    type  mas=array[1..N,1..N] of integer;
var
bf:integer;
B:mas;
 
procedure vvod(var B:mas);
var i, j:integer;
begin
for i:=1 to N do
for j:=1 to N do
B[i,j]:=random(100);
end;
 
procedure vivod(var B:mas);
var  i, j:integer;
begin
for i:=1 to n do
begin
for j:=1 to n do
write(b[i,j],' ');
writeln;
end;
end;
 
procedure sort(var B:mas; bf:integer);
var i, j, k:integer;
begin
for j:=1 to n do
if j mod 2 <> 0 then begin
for i:=1 to n-1 do
for k:=i+1 to n do
if B[i,j]<B[k,j] then
begin
bf:=B[i,j];
B[i,j]:=B[k,j];
B[k,j]:=bf;
end;
end;
end;
 
procedure diog(var B:mas; bf:integer);
var i, j:integer;
begin
for i:=1 to N do
for j:=1 to N do begin
if i=j then begin
B[1,j]:=B[i,j];
B[10,j]:=B[i,j];
end;
end;
end;
 
BEGIN
vvod(b);
 Writeln('Массив:');
vivod(b);
sort(b,bf);
 writeln('Сортировка');
vivod(b);
writeln('Перемещение главное диоганали ');
diog (b,bf);
vivod(b);
end.