Lucrare grafica

Isac Gheorghe TI-195

Determinaţi complexitatea asimptotică a algoritmului ce prelucrează date de volum

n.

I. h←1
2: while h ≤ n do
3: …(O(1))
4: n  n div 2

O(log n)

II: k←1
2: for i← 0 to n-1 do
3: k← 8*k
4: for j← 1 to k do
5: … O(1)

O(n^2)
Prelucrare Θ . E prelucrare de cost constant.

III: i2
while i ≤ n do
3: …(O(1))
4: j  2i
5: while j ≤ n do
6:                         …(O(1))
7: jj+i
8: ii+1

O(nlogn)

IV: i2
2: while i ≤ n do
3: …(O(1))
4: j1
5: while j ≤ n do
6:                         …(O(1))
7: j  2j
8: ii+1

O(nlogn)
Rezolvați recurențele

1. tn - 2tn-1 = 2n

b=2 p(2)=1
(x-2)(x-2)=0
r1=2 r2=2
t(n)=c1*2n + c2*n2n

2.tn - 2tn-1 = n3n

(x-2)(x-3)n = 0
r1= 2 r2 = 3
t(n)=c1*2n + c2*3n+c3*n*3n

3.tn - tn-1 = n

(x-1)(x-1)^n = 0
r=1
t(n) = cn*1n +c2*n*1n+c3*n2*1n

4.

t(k)= T(2k) = T(n)

t(k) = 2t(k-1)+ 2k
(x-2)(x-2) = 0
r1= 2 r2= 2
t(k) = c12k+c2 *k*2k
T(n) =c1*2log2 n + c2*log2 n * 2log2 n
T(n) =c1*n + c2*log(2)n*n

5.

t(k) = 8t(k-1)+2k
(x-8)(x-2) = 0
r1= 8 r2= 2
T(n) = c1*8 log2 n + c2*log(2) * 2 log2 n
T(n) = c1*n3 + c2*n
6.

t(k)= T(3k) = T(n)

t(k) = 9t(k-1)+32k
t(k-9) t(k-1)=3^2k , t(k-9tk-1)=9k
(x-9)(x-9) = 0
r1= 9 r2= 9
T(n) =c1*9k + c2*9k * k
T(n) = c1*n2 + c2* n2*log(3)n

7.

t(k) = 2t(k-1)+2k*log2k
t(k-2) t(k-1)= 2k *k
(x-2)(x-2)2 = 0
r1,2,3= 2
t(k)= c1*2k +c2*k*2k +c3*k2*2k
T(n) = c1*2 log2 n + c2*log(2)n * 2 log2 n + c3*(log(2)n)2+2 log2 n
T(n) = c1*n + c2*n*log(2)n + c3*n*(log(2)n)2

8.

t(k)= T(1^k) = T(n)

t(k) = t(k-1)+21
(x-1)2 = 0
2x-2=0
r= 1
t(k)=c1*1k
T(n) = c1*1 log2 n
T(n) = c1*n

9.

t(k)= T(3^k) = T(n)

t(k) =27t(k-1)+ 33k *log(3)
(x-27)(x-3)3k = 0
r1=27 r2=3
t(k)= c1*27^k + c2*33k
T(n)= c1*n^3 + c2*n
10.
a=2 b=1/2 f(n)= nlog(2)n
n^log(1/2)2 = n-1 =1/n
T(n) = Θ nlog(2)n