1.

30-2006.
:

A n
,
n.

B n
n1 , ,
.

C n
n/3 O(n2) .

n
A : T (n) 8T ( ) n
2
1 . , T(n) = (n3).

B : T (n) T (n 1) n
T(n) = T(n-1) + n = T(n-2) + n-1 + n = = (n2) .

n
C : T (n) 9T ( ) n 2
3
2 . , T(n) = (n2logn).
.

2.

30-2006.

A n
, ,
( n/4)
( n) n.

B n
n/2 , ,
.

C n
n/2 O(n2)
.

n
A : T (n) T ( ) n
4
3 . , T(n) = (n)

n
B : T ( n ) T ( ) O (1)
2
2 . , T(n) = (logn)

n
C : T ( n) 4T ( ) n 2
2
2 . , T(n) = (n2logn)
.

3.

30-2007.

. .
f1(n) = n2 log n + log2007(n3)
f2(n) = 2n + n2
f3(n) = nlog n + n2 log n
f4(n) = n0.5+ log0.5(2n)
f5(n) = n2 log 2 + 2 log2 n

,
.
f1(n) = n2 log n + log2007(n3) = (n2 log n)
f2(n) = 2n + n2 = (2n)
f3(n) = nlog n + n2 log n = (nlog n)

f4(n) = n0.5 + log0.5(2n) = (n0.5)

f5(n) = n2 log 2 + 2 log2 n = (n2)
:
f4(n) = n0.5 + log0.5(2n)
f5(n) = n2 log 2 + 2 log2 n
f1(n) = n2 log n + log2007(n3)
f3(n) = nlog n + n2 log n
f2(n) = 2n + n2

4. 30-2007.

(shortest paths in graphs),

,
(optimal binary search tree),
,
n- Fibonacci.
O (n), O (n 2 ), O (n3 ) .

.

3 4 O (n3 ) . n 2 ,
P (i, j ) i
j. : ()
i
j, ()
i j.
n .
2 O (n 2 ) . n 2 . (n
) P (i, j ) . P (i, j )
i j ,
. P (i, j )
P (i 1, j 1) , P (i, j 1) P (i 1, j ).
.
5 O (n) .

 1 O (n) .

O (n) .

5. 30-2007.
.
f1(n) = n log2(n) + log10(n)
f2(n) = n log n + log(nn)
f3(n) = n log0,5(n) + log2(3n)
f4(n) = n1,5 + log0,5(2n)
f5(n) = (1,001)n + log(100n)

,
.
f1(n) = n log2(n) + log10(n) = ( n log2(n) )
f2(n) = n log n + log(nn) = ( log(nn) ) = ( n log n )
f3(n) = n log0,5(n) + log2(3n) = ( log2(3n) ) = ( n2 )
f4(n) = n1,5 + log0.5(2n) = ( n1,5 )
f5(n) = (1,001)n + log(100n) = ( (1,001)n )
:
f2(n) = n log n + log(nn) , f1(n) = n log2(n) + log10(n) , f4(n) = n1.5 + log0.5(2n) , f3(n)
= n log0,5(n) + log2(3n) , f5(n) = (1,001)n + log(100n) .

6.

30-2007.

A n
,
n.

B n
n
n 1, , , .

n
n/2 O(n2) .


;
4 . Fourier (FFT),
quicksort,
Strassen .

, , ,
.

: T (n) 2T (n / 2) n , a 2 b 2
(n log n) , mergesort FFT. FFT
2 ( )
: n ,
n/2
.
B:

T (n) T (n k ) T (k ) n ,

(n 2 ) . k=1 ((
, ,
).

quicksort

.
: T (n) 7T (n / 2) n 2 ,

(n log2 7 ) ,

a 7 b 2 ,

Strassen

. Strassen 2
n 7 n/2 ( 7
Strassen) .
, , ,
.

7. 30-2008. ) :
T1(n) = 7 T1(n/2) + n2 , T2(n) = 7 T2(n/2) + n3 .

) :
f1(n) = 10n , f2(n) = n1/3 , f3(n) = nn , f4(n) = log(n) , f 5 (n) 2

log( n )

) , a=7, b=2, logba = 2.81.

n2 = O(n2.81-) T1(n) =(n2.81).
n3 = (n2.81+) 7 (n/2)3 = 7/8 n3 < c n3 , 7/8<c<1, T2(n) =(n3).

) f4 < f2 < f1 < f3 . f5 ,

.
log f4 = log log n
log f5 = (log n)0.5
log f2 = 1/3 log n
log log n < (log n)0.5 < 1/3 log n f4 < f5 < f2 .
: f4 < f5 < f2 < f1 < f3 .

8.

30-2008. ) :
T1(n) = 5 T1(n/2) + n2 , T2(n) = 5 T2(n/2) + n3 .

) :
f1(n) = n4/3 , f 2 (n) 2

log( n )

, f3(n) = 2n , f4(n) = nlogn , f 5 (n) 22 .

) , a=5, b=2, logba = 2.32.

n2 = O(n2.32-) T1(n) =(n2.32).
n3 = (n2.32+) 5 (n/2)3 = 5/8 n3 < c n3 , 5/8<c<1, T2(n) =(n3).

) f1 < f4 f2 < f3 < f5.

.
log f1 = 4/3 log n

log f2 = (log n)0.5

log f3 = n
log f4 = (log n )2
(log n)0.5 < 4/3 log n < (log n )2 < n f2 < f1 < f4 < f3.
: f2 < f1 < f4 < f3 < f5 .

9. 30-2008. n ,
:
(i) -,

3n
4

n
,
8

(n).
(ii) B -,

4n
10

9n
,
15

(n).
(i) (ii).

( 3.6, . 73, 1)
(i)

T ( n) T (

3n
n
) T ( ) ( n ) ,
4
8

3 1 7
1 ,
4 8 8

T ( n ) ( n )
(ii)

T ( n) T (

4n
9n
4 9 12 18 30
) T ( ) ( n) ,

1,
10
15
10 15 30 30 30

T (n) (n log n)

10. 30-1-2008.
:

11. 30-2009.
:

f1 lg n

lg n

f2 n e , f3

f 4 log n n

log n

f5 4lg

lg 2 log
10.
:
2

f1 lg n

lg n

f2 e 2
n

f3

lg e
n

f5 4

lg lg n lg n

,
n
2

n 2

f 4 log n n
lg 2 n

log n

n lg n
2

log n

2
2 lg n

22lg

n log n

lg log n n log n

f 2 f1 f 5 f 3 f 4

12. 30-2009. 2n (3n).

:
T1(n) = 7T1(n/2) + n2 ,

T2(n) = 7T2(n/2) + n3.

:
) 2n (3n). > 0 n0
3n <= 2n n >=n0.
) , a =7, b=2, 2<logba <3.
n2 = O(n^( logba -)) T1(n) = (n^( logba)).
n3 = (n^( logba +)) 7 (n/2)3 = 7/8 n3 < c n3 , 7/8<c<1, T2(n) =(n3).

13.
30-1-2009.
:
() n 16
n/8 n2/3.
() n 3
n/4 n.
() n 16
n/4 n2.
() 1 n 2
n/2 n3.

;
, ;

14. 30-2010. ()
.
n, n/9
3

n 2 .
n,
n/7
n2.
n n-1
n, n
n-2
n.

,
.

() :

f1 2

f 2 log n

f3

log n

n2

f4

log n 2).

() :

T ( n ) = 4T (n / 9) n 3 / 2 .

a=4,

log 9 4<1<3/ 2 ,

b=9,

af ( n / b) = 4( n/9)3/ 2 = 4n 3/ 2 / 27 < Cn 3/ 2 4/27 C < 1,

o . . ( n 3/ 2 ) .
:

T ( n ) = 49T ( n / 7) n 2 .

a=49, b=7, log 7 49=2 , o .

.

T (n ) = T ( n 1) n

( n 2 log n )

. n

T ( n ) = T ( n 2) n .

n .
n

T ( n ) = T ( n 2) n

T (n ) = T (n 2) n T n 4 (n 2) n T n 6 n 4 (n 2) n
.

T n c 2 4 6 L n 6 n 4 ( n 2) n ,

n=2k ().

T n c 2 1 2 L k 1 k c 2

k k 1
n n
c 1
2
2 2

2
n .

T ( n ) = T ( n 1) n

2
n .

() 2

f 2 log n
f3

f4

log n

n n
2

n log n 2

2
log n

n log

2
log n
log n

1.

log

n log n

4,

n log n / 2

f 3 f 2 f1 f 4 .

30-2010. (A)

(A1) n,
n/3
n3.
(A2) n,
n/2
n.
(A3) n-1
n3.

,
.

: 23.32 = 10,

3
4
i

(
n
).
i 1

() :

f1 2 log n

f 2 log n 3
log n

log n

f3

log n

e , f4

log n

2).

(1)

T (n) 7T ( n / 3) n3 .

a=7, b=3, log 3 7 2 3 .

af ( n / b) cf ( n ) c<1.

n
af ( n / b) 7
3

f (n ) n3

7 n3
7
cf (n) ,
c 1,
27
27

o . .

( n 3 ) .

(2)

T ( n ) 10T ( n / 2) n .

a=10, b=2, log 2 10 3 1 ,

o . .

n log 2 10 n3,32 .

3
(3) T n T (n 1) n .
3
3
T n T ( n 2) ( n 1) n

3
3
3
3
3
T n c 1 2 ... ( n 2) ( n 1) n .

(n 4 ) .

.

() 2

f1 2 log n

f 2 log n3
f3
f4

log n

log n

ee

log n

1
log n

log e
log n

2log 3log n log n 2log n (log3log log n ) .

1/ 2 log n

:
2.

log log n3 log n

log n
log n
2

log n 2
2

f 3 f 2 f 4 f1 .