Код
program Sheikernaya_sortirovka;
const N=10;
type
mas=array[0..N] of integer;
procedure sheiker(var J,L:integer;var a:mas);
var
x,K,R:integer;
begin
L:=2;
R:=N;
K:=N;
repeat
for J:=R downto L do
if a[J-1]>a[J] then begin
x:=a[J-1];
a[J-1]:=a[J];
a[J]:=x;
K:=J
end;
L:=K+1;
for J:=L to R do
if a[J-1]>a[J] then begin
x:=a[J-1];
a[J-1]:=a[J];
a[J]:=x;
K:=J
end;
R:=K-1
until L>R;
end;
var
J,L,K,R,X,N,I:integer;
s:string[50];
begin
writeln('Vvedite stroku'); readln(s);
for I:=1 to N do read(a[I]);
sheiker(J,L,a);
writeln('Result:');
for I:=1 to N do write(a[I],' ')
end.
const N=10;
type
mas=array[0..N] of integer;
procedure sheiker(var J,L:integer;var a:mas);
var
x,K,R:integer;
begin
L:=2;
R:=N;
K:=N;
repeat
for J:=R downto L do
if a[J-1]>a[J] then begin
x:=a[J-1];
a[J-1]:=a[J];
a[J]:=x;
K:=J
end;
L:=K+1;
for J:=L to R do
if a[J-1]>a[J] then begin
x:=a[J-1];
a[J-1]:=a[J];
a[J]:=x;
K:=J
end;
R:=K-1
until L>R;
end;
var
J,L,K,R,X,N,I:integer;
s:string[50];
begin
writeln('Vvedite stroku'); readln(s);
for I:=1 to N do read(a[I]);
sheiker(J,L,a);
writeln('Result:');
for I:=1 to N do write(a[I],' ')
end.