, , , , . . , , , , , .
:
a) ;
b) ;
c) , ;
d) .
. ( 4 ).
Insertion_Sort(A)
1 for j 1 to length[ A ]
2 do key A [ j ]
3 i j 1
4 while i > 0 A [ i ] > key
5 do A [ i + 1] A [ i ]
6 i i 1
7 A [ i + 1] key
8 end for
, (i > 0) & (A [ i ] > key). .
: ,
: .
:
,
(i > 0),
(A [ i ] > key).
( 1):
1
: .
:
1: : N = 5, A = {3, 2, 8, 9, 1} .
: A = {3, 2, 8, 9, 1}.
2: : N = 9, A = {9, 8, 17, 298, 1, 1, 4, 2, 4} , (key) 2 N .
: A = {1, 1, 2, 4, 4, 8, 9, 17, 298}.
3: : N = 3, A = {10, 2, 8} .
: A = {2, 8, 10}.