1

Bubblesort O(n 2 ) .

n - 1 swap ( O ( n) ).

. T :

1 : n 1 n 1 swaps.
2 : n 1 n 2 swaps.
..
n 1 : n 1 1 swap.
n - : n 1 0 swaps.

: k1 n (n 1) k2 ((n 1) (n 2) ... 1) , k1
, k2 swap.
k3 .
loop n k4
:

k1 n (n 1) k2 ((n 1) (n 2) ... 1) k3 k4 n
n

(n i)
i 1

n (n 1)
:
2

1
n (n 1)
2
2
k1 n (n 1) k2
k3 k4 n k1 (n n) k2 (n n) k4 n k3
2
2

1
1
n 2 (k1 k2 ) n(k1 k2 ) n k4 k3
2
2
O(n 2 ) .
n0 C n n0 :

1
1
n 2 (k1 k2 ) n(k1 k2 ) n k4 k3 C n 2
2
2
:
n 1
1
1
1
n2 (k1 k2 ) n(k1 k2 ) n k4 k3 n 2 (k1 k2 ) n k4 k3 n 2 k1 n 2 k2 n 2 k4 n 2 k3
2
2
2
n2 (k1 k2 k3 k4 )

C k1 k2 k3 k4 n0 1 .

 2

, ,
2i i / .
bottom-level
( ). :

2( h1)1 1
h
2 1

2 1 .
i 0
2 1
h 1

3
:

((a < b) && (b < c)) || (c < d) .

expression tree .

Traversals

Preorder : || & & a b b c c d

Inorder : a b & & b c || c d

Postorder: a b b c & & c d ||

 4
AVL.

VL : 5,6
VL : 1,2,3,4

VL

:
2,4,5,6,7,
8,9,10

VL

: 1,3

 5
1

. . double right-left
rotation balancing.

C right rotation balancing.

6
double right-left
rotation balancing.

7
D.

8
W double left-right rotation X balancing.

9
E right rotation balancing.

10
V left rotation D balancing.

11
F double right-left rotation C balance.

 6


heapifications .

26.

33 35
.

29.

33.

29 26.

swap

.

35.

19.

12.

22.

33 ,
12
.

swap 12 29,
12 26.

(
sorting)


.

35 ,
22
.

33
22(heapification).

29 ,
19
.

19 26.

26 ,
12
.

12 ,
.

22 12.

sorting :
35 33 29 26 22 19 - 12

22 ,
12
.

Swap 12 19.

19 ,
12
.