[1,7,5,4,9,8,12,11,2,10,3,6] (N = 12).
( "" , ):
(a[6], a[5], a[4]) ( ):
10 9 | |||||||||
9 10 | |||||||||
11 4 | |||||
4 11 | |||||
(a[3] a[2]) - :
12 5 | |||||||||||
5 12 | |||||||||||
11 7 | |||||||||||
7 11 | |||||||||||
(a[1]) :
12 1 | |||||||
1 12 | |||||||
7 1 | |||||||
8 1 | |||||||
1 8 | |||||||
6 1 | |||||
1 6 | |||||
, : a[i], a[2*i] a[2*i+1] "".
, :
0- : ( ).
1- : N-1 , , :
- "" ;
- () , , , ( i- N-).
, , "", 1:
for i:= N downto 2 do
begin x:= a[1];
a[1]:= a[i];
a[i]:= x;
j:= 1;
while j<=((i-1)div 2) do
begin k:= 2*j;
if (k+1<=i-1) and (a[k]<a[k+1])
then k:= k+1;
if a[k]>a[j]
then begin x:= a[j];
a[j]:= a[k];
a[k]:= x;
j:= k
end
else break
end
end;
. , : [12,11,8,7,10,6,5,4,2,9,3,1]. , . , , - , :
|
|
1) a[1] a[12]: [1,11,8,7,10,6,5,4,2,9,3,12];
2) a[1], : [11,10,8,7,9,6,5,4,2,1,3,12];
3) a[1] a[11]: [3,10,8,7,9,6,5,4,2,1,11,12];
4) a[1], : [10,9,8,7,3,6,5,4,2,1,11,12];
5) a[1] a[10]: [1,9,8,7,3,6,5,4,2,10,11,12];
6) a[1]: [9,7,8,4,3,6,5,1,2,10,11,12];
7) a[1] a[9]: [2,7,8,4,3,6,5,1,9,10,11,12];
8) a[1]: [8,7,6,4,3,2,5,1,9,10,11,12];
9) a[1] a[8]: [1,7,6,4,3,2,5,8,9,10,11,12];
10) a[1]: [7,4,6,1,3,2,5,8,9,10,11,12];
11) a[1] a[7]: [5,4,6,1,3,2,7,8,9,10,11,12];
12) a[1]: [6,4,5,1,3,2,7,8,9,10,11,12];
13) a[1] a[6]: [2,4,5,1,3,6,7,8,9,10,11,12];
14) a[1]: [5,4,2,1,3,6,7,8,9,10,11,12];
15) a[1] a[5]: [3,4,2,1,5,6,7,8,9,10,11,12];
16) a[1]: [4,3,2,1,5,6,7,8,9,10,11,12];
17) a[1] a[4]: [1,3,2,4,5,6,7,8,9,10,11,12];
18) a[1]: [3,1,2,4,5,6,7,8,9,10,11,12];
19) a[1] a[3]: [2,1,3,4,5,6,7,8,9,10,11,12];
20) ;
21) a[1] a[2]: [1,2,3,4,5,6,7,8,9,10,11,12];
22) , .
. , . .
, .
Stack , .
, .
Empty (<_>):Boolean;
Add(<_>,<_>):<_>;
Take(<_>):_;
Del (<_>):_;
LIFO ( )
FILO( )
, .
. , . .
Queue , : 1 , ! , .
Empty (<_>):Boolean;
Add(<_>,<_>):<_>;
Take(<_>):_;
Del (<_>):_;
. . /.