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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
| {$IFDEF FPC}
{$MODE DELPHI}
{$ENDIF}
unit Program2;
interface
const errOk=0;
errBufferSize=-1;
errInvalidIndex=-2;
function SearchInArray(x:integer; a:array of integer):integer;
function MinInArray(a:array of integer):integer;
function MaxInArray(a:array of integer):integer;
procedure PasteInArray(x,i:integer; var a:array of integer);
procedure DeleteFromArray(i:integer; var a:array of integer);
procedure BubbleSortUpArray(var a:array of integer);
function MergeSort(var a:array of Integer;
var buf:array of Integer; FirstItem, LastItem:Integer):Integer;
procedure QuickSort(var a:array of Integer;
aFirst, aLast:Integer);
procedure GenArray(var a:array of Integer;
aFirst, aLast, AValue :Integer);
procedure PrintArray(const a:array of Integer);
implementation
const MSCutOff=16;
function SearchInArray(x:integer; a:array of integer):integer;
var i:integer;
f:boolean;
begin
f:=true;
result:=-1;
for i:=0 to high(a) do
if (a[i]=x) and f then
begin
result:=i;
f:=false;
end;
end;
function MinInArray(a:array of integer):integer;
var i, min:integer;
begin
min:=a[high(a)];
for i:=0 to high(a)-1 do
if a[i]<min then min:=a[i];
result:=min;
end;
function MaxInArray(a:array of integer):integer;
var i, max:integer;
begin
max:=a[high(a)];
for i:=0 to high(a)-1 do
if a[i]>max then max:=a[i];
result:=max;
end;
procedure PasteInArray(x,i:integer; var a:array of integer);
var j:integer;
Begin
for j:=high(a) downto i do
a[j+1]:=a[j];
a[j]:=x;
end;
procedure DeleteFromArray(i:integer; var a:array of integer);
var j:integer;
begin
for j:=high(a) downto i+1 do
a[j-1]:=a[j];
a[high(a)]:=0;
end;
procedure BubbleSortUpArray(var a:array of integer);
var i,buf:integer;
f:boolean;
begin
f:=true;
while f do
begin
f:=false;
for i:=0 to high(a)-1 do
if a[i]>a[i+1] then
begin
buf:=a[i];
a[i]:=a[i+1];
a[i+1]:=buf;
f:=true;
end;
end;
end;
function MergeSort(var a:array of Integer;
var buf:array of Integer;
FirstItem,
LastItem:Integer
):Integer;
procedure InsSort(aFirst, aLast:Integer);
var i,j,el:integer;
begin
for i:=aFirst+1 to aLast do begin
el:=a[i];
j:=i-1;
while (j>-1)and(a[j]>el) do begin
a[j+1]:=a[j];
j:=j-1;
end;
a[j+1]:=el;
end;
end;
procedure MSort(aFirst, aLast:Integer);
var mid, i, j, toInx, FirstCount:Integer;
begin
mid:=(aFirst + aLast) div 2;
if (aFirst < mid) then
if (mid-aFirst)<=MSCutOff then InsSort(aFirst, mid)
else MSort(aFirst, mid);
if ((mid+1) < aLast) then
if (aLast-succ(mid))<=MSCutOff then InsSort(mid+1, aLast)
else MSort(succ(mid), aLast);
FirstCount:=(mid - aFirst) + 1;
Move(a[aFirst], buf[0], FirstCount*sizeof(Integer));
i:=0;
j:=mid + 1;
toInx:=aFirst;
while (i<FirstCount)and(j<=aLast) do begin
if buf[i]<=a[j] then begin
a[toInx]:=buf[i];
inc(i);
end
else begin
a[toInx]:=a[j];
inc(j);
end;
inc(toInx);
end;
if i < FirstCount then
Move(buf[i], a[toInx], (FirstCount-i)Integer);
end;
var tmp:Integer;
begin
if FirstItem>LastItem then begin
tmp:=FirstItem;
FirstItem:=LastItem;
LastItem:=tmp;
end;
if (FirstItem<0)or(LastItem>High(a)) then begin
Result:=errInvalidIndex;
Exit;
end;
if Length(buf)<(LastItem - FirstItem) div 2 then begin
Result:=errBufferSize;
Exit;
end;
MSort(FirstItem, LastItem);
Result:=errOk;
end;
procedure QuickSort(var a:array of Integer; aFirst,
aLast:Integer);
var l, r:Integer;
base:Integer;
procedure Swap(var a, b:Integer);
var temp:Integer;
begin
temp:=a;
a:=b;
b:=temp;
end;
begin
while aFirst<aLast do begin
if aLast-AFirst>=2 then begin
r:=(aFirst + aLast) div 2;
if a[aFirst] > a[r] then Swap(a[aFirst], a[r]);
if a[aFirst] > a[aLast] then Swap(a[aFirst], a[aLast]);
if a[r] > a[aLast] then Swap(a[r], a[aLast]);
base:=a[r];
end
else base:=a[aFirst];
l:=aFirst-1;
r:=aLast+1;
while True do begin
repeat dec(r) until a[r]<=base;
repeat inc(l) until a[l]>=base;
if l>=r then Break;
Swap(a[l], a[r]);
end;
if aFirst<r then QuickSort(a, aFirst, r);
aFirst:=r+1;
end;
end;
procedure GenArray(var a:array of Integer;
aFirst, aLast, AValue :Integer);
var i:Integer;
begin
Randomize;
for i:=aFirst to aLast do a[i]:=Random(AValue);
end;
procedure PrintArray(const a:array of Integer);
var i:Integer;
begin
for i:=0 to High(a) do write(a[i], ' ');
end;
end. |
(
