 Сообщение было отмечено RacheT как решение
Решение
| Pascal | 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
| type TLessFunc = function (a, b: Integer): Boolean;
procedure ShakerSort(var a: array of Integer; IsLess: TLessFunc);
var l, r, n, j, t: Integer;
begin
l:=Low(a); n:=l; r:=High(a);
while l<r do begin
for j:=l to r-1 do
if IsLess(a[j+1],a[j]) then begin
n:=j; t:=a[j]; a[j]:=a[j+1]; a[j+1]:=t;
end;
r:=n;
for j:=r downto l+1 do
if IsLess(a[j],a[j-1]) then begin
n:=j; t:=a[j]; a[j]:=a[j-1]; a[j-1]:=t;
end;
l:=n;
end;
end;
procedure mWrite(const a: array of Integer);
var i: Integer;
begin
for i:=Low(a) to High(a) do Write(' ',a[i]); WriteLn;
end;
{$F+}
function less(a, b: Integer): Boolean; begin less:=a<b end;
function more(a, b: Integer): Boolean; begin more:=a>b end;
const a: array [1..8] of Integer = (32,14,36,1,0,62,10,3);
begin
mWrite(a);
ShakerSort(a,less); mWrite(a);
ShakerSort(a,more); mWrite(a);
end. |
|
или | Pascal | 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
| type TLessFunc = function (a, b: Integer): Boolean;
procedure ShakerSort(var a: array of Integer; IsLess: TLessFunc);
procedure swp(var a, b: Integer); var t: Integer; begin t:=a; a:=b; b:=t; end;
var l, r, n, j: Integer;
begin
l:=Low(a); n:=l; r:=High(a);
while l<r do begin
for j:=l to r-1 do if IsLess(a[j+1],a[j]) then begin n:=j; swp(a[j],a[j+1]); end; r:=n;
for j:=r downto l+1 do if IsLess(a[j],a[j-1]) then begin n:=j; swp(a[j],a[j-1]); end; l:=n;
end;
end;
procedure mWrite(const a: array of Integer);
var i: Integer;
begin
for i:=Low(a) to High(a) do Write(' ',a[i]); WriteLn;
end;
{$F+}
function less(a, b: Integer): Boolean; begin less:=a<b end;
function more(a, b: Integer): Boolean; begin more:=a>b end;
const a: array [1..8] of Integer = (32,14,36,1,0,62,10,3);
begin
mWrite(a);
ShakerSort(a,less); mWrite(a);
ShakerSort(a,more); mWrite(a);
end. |
|
но можно переписать и чуть менее очевидно: | Pascal | 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
| type TLessFunc = function (a, b: Integer): Boolean;
procedure ShakerSort(var a: array of Integer; IsLess: TLessFunc);
var l, r, n, j: Integer;
procedure swp(var a, b: Integer); var t: Integer; begin n:=j; t:=a; a:=b; b:=t; end;
begin
l:=Low(a); n:=l; r:=High(a);
while l<r do begin
for j:=l to r-1 do if IsLess(a[j+1],a[j]) then swp(a[j],a[j+1]); r:=n;
for j:=r downto l+1 do if IsLess(a[j],a[j-1]) then swp(a[j],a[j-1]); l:=n;
end;
end;
procedure mWrite(const a: array of Integer);
var i: Integer;
begin
for i:=Low(a) to High(a) do Write(' ',a[i]); WriteLn;
end;
{$F+}
function less(a, b: Integer): Boolean; begin less:=a<b end;
function more(a, b: Integer): Boolean; begin more:=a>b end;
const a: array [1..8] of Integer = (32,14,36,1,0,62,10,3);
begin
mWrite(a);
ShakerSort(a,less); mWrite(a);
ShakerSort(a,more); mWrite(a);
end. |
|
1
|
(
Сообщение было отмечено RacheT как решение
