Министерство Образования и Исследований

Республики Молдова
Технический Университет Молдовs

Отчет
по лабораторной работе Nr.1.
 Analiza şi proiectarea algoritmilor

Тема: Сравнение времени работы алгоритмов

Вариант 17

Выполнил ст.гр. TI-2210 Шологан Артемиос

Проверил ассист.универ.

Кишинев – 2023
Алгоритмы по эффективности в порядке возрастания
 1/n
1.2

0.8

0.6

0.4

0.2

0
0 5 10 15 20 25 30

log log n
2.5

1.5

0.5

0
0 5 10 15 20 25 30
 ln n
3.5

2.5

1.5

0.5

0
0 5 10 15 20 25 30

1.

n log n
6

0
0 5 10 15 20 25 30
 √n
6

0
0 5 10 15 20 25 30

log n
6

0
0 5 10 15 20 25 30

n
30

25

20

15

10

0
0 5 10 15 20 25 30
 log(n!)
50
45
40
35
30
25
20
15
10
5
0
0 2 4 6 8 10 12 14 16 18

n log n
140

120

100

80

60

40

20

0
0 5 10 15 20 25 30

n^2
700

600

500

400

300

200

100

0
0 5 10 15 20 25 30
 n^3
16000

14000

12000

10000

8000

6000

4000

2000

0
0 5 10 15 20 25 30

2^n
18000000

16000000

14000000

12000000

10000000

8000000

6000000

4000000

2000000

0
0 5 10 15 20 25 30

n!
70000000000000

60000000000000

50000000000000

40000000000000

30000000000000

20000000000000

10000000000000

0
0 5 10 15 20 25 30
 n^n
1.6E+033

1.4E+033

1.2E+033

1E+033

8E+032

6E+032

4E+032

2E+032

0
0 5 10 15 20 25 30
 log m
2 (√ 2¿ ¿ logm
f(n) = 2log m
g(n) = (√ 2¿ ¿ logm
c1*(√ 2¿ ¿ logm ≤2log m≤c2*(√ 2¿ ¿ logm
log m
c1≤ 2 ≤c2
¿¿
c1≤√ m≤c2
m0=2 →c1≤√ 2≤c2
m0=4 →c1≤2≤c2
С1=√ 2
f(n)=Ω(g(n))
lim ¿ ¿ ¿=0
n→∞
f(n)=ω (g(n))

n n+ 1

22 22
 n
f(n) = 22
n+ 1
g(n) = 22
n+ 1 n n+ 1
c1*22 ≤22 ≤c2*22
n

22
c1≤ n+1 ≤c2
22
1
n0=1 →c1≤ ≤c2
4
1
n0=3 →c1≤ ≤c2
4
с2=const
f(n)=θ(g(n))

n! (n+1)!
f(n) = n !
g(n) = (n+1)!
c1*(n+1)!≤n !≤c2*(n+1)!
n!
c1≤ ≤c2
(n+1)!
2!
n0=2→c1≤ ≤c2
3!
4!
n0=4→c1≤ ≤c2
5!
с2=1/2
f(n)=(O(g(n))
lim ¿ ¿ ¿=0
n→∞
f(n)=o(g(n))

Log(n!) (log n)!

f(n) = log (n !)
g(n) = (log (n))!
c1*log (n)!≤log (n !)! ≤c2*log (n)!
log (n !)
c1≤ ≤c2
log (n)!
n0=8→c1≤2.5≤c2
n0=16→c1≤1.8≤c2
с2=2.5
f(n)=O(g(n))

( )
❑
log (n !)
lim =0
n → ∞ log (n)!

f(n)=o(g(n))

3 n e
n
n*2n
( ¿¿
2

**
 3 n
f(n) = ( ¿ ¿
2
g1(n) = e n
g2(n) = n*2n
c1*e n≤n*2n≤c2*e n
n
n ∗2
c1≤ n ≤c2
e
n0=6 => c1≤0.95 ≤c2
n0=8 => c1≤0. 68≤c2
C2=0.95
g(2n)=O(g1(n))

( )
n ❑
n∗2
lim n =0
n→∞ e
g(2n)=o(g1(n))
 3 n
c1*e n≤( ¿ ¿ ≤c2*e n
2
c1≤¿ ¿≤c2
n0=6→c1≤0.02≤c2
n0=8→c1≤0.008≤c2
с2=0.02
f(n)=O(g1(n))
lim ¿ ¿ ¿=0
n→∞
f(n)=o(g1(n))
3 n
c1*n*2n≤( ¿ ¿ ≤c2*n*2n
2
c1≤¿ ¿≤c2
n0=6→c1≤0.02≤c2
n0=8→c1≤0.01≤c2
с2=0.02
f(n)=O(g2(n))
lim ¿ ¿ ¿=0
n→∞
f(n)=o(g2(n))

n 2n n
3
n
2
f(n) = n3
g1(n) = n2
g2(n) = n
g3(n) = 2n
c1*n2 ≤n3 ≤c2*n2
3
n
c1≤ 2 ≤c2
n
n0=5→c1≤5≤c2
n0=6→c1≤6≤c2
С1=5
f(n)=Ω(g1(n))

( )
2 ❑
n
lim 3 =0
n→∞ n
f(n)=ω (g1(n))

❑ ❑
c1*n ≤n3 ≤c2*n
3
n
c1≤ ≤c2
n❑
n0=2→c1≤4≤c2
n0=3→c1≤9≤c2
С1=4
f(n)=Ω(g2(n))
 ( )
❑
n❑
lim 3 =0
n→∞ n

f(n)=ω (g2(n))

c1*2 n≤n3 ≤c2*2 n

3
n
c1≤ ≤c2
2n
n0=5→c1≤10≤c2
n0=6→c1≤12≤c2
С1=10
f(n)=Ω(g3(n))

( )
2n ❑
lim 3 =0
n→∞ n

f(n)=ω (g3(n))
❑
c1*n2 ≤2n ≤c2*n2
2n
c1≤ 2 ≤c2
n
n0=2→c1≤1≤c2
n0=4→c1≤0.5≤c2
С2=10
g3(n)=O(g1(n))

lim
n→∞ ( )
2n ❑
n
2 =0

g3(n)=o(g1(n))

(logn)(logn)
1 loglog n
n
n logn

1
f(n) = n logn
g1(n) = n loglog n
 (logn)
g2(n) = (logn)

1
c1*n loglog n≤n logn ≤c2*n loglog n
1
log n
c1≤ n ≤c2
log log n
n
n0=6→c1≤0.17≤c2
n0=16→c1≤0.007≤c2
с2=0.17
f(n)=O(g1(n))

lim
n→∞ ( f (n) ❑
g 1(n)
=0 )
f(n)=o(g1(n))
(logn) 1 (logn)
c1*(logn) ≤n logn ≤c2*(logn)
1
logn
c1≤ n ≤c2
(logn )
( log n)
n0=6→c1≤0.17≤c2
1
n0=16→c1≤ ≤c2
128
с2=0.17
f(n)=O(g2(n))

lim
n→∞ ( f (n) ❑
g 2(n)
=0 )
f(n)=o(g2(n))
g1(n)=g2(n)
g1(n)=θ(g2(n))

ln n ln ln n

f(n) = ln n
g(n) = ln ln n
c1*ln ln n≤ln n ≤c2*ln ln n
ln n
c1≤ ≤c2
ln ln n
n0=15 →c1≤2.71≤c2
n0=20 →c1≤2.73≤c2
 С1=2.71
f(n)=Ω(g(n))

lim
n→∞
( ln n )
ln ln n ❑
=0

f(n)=ω (g(n))

4 log n 2
log n n log n

f(n) = log 2 n
g1(n) = 4 log n
g2(n)=n log n
c1*n log n≤log 2 n≤c2*n log n
2
log n
c1≤ ≤c2
n log n
m0=16 →c1≤1/4≤c2
m0=29 →c1≤25/130≤c2
С2=1/4
f(n)=O(g2(n))

( )
2 ❑
log n
lim =0
n→∞ n log n
f(n)=o (g2(n))

c1*4 log n ≤log 2 n≤c2*4 log n

2
log n
c1≤ ≤c2
4 log n
m0=16 →c1≤1≤c2
m0=32 →c1≤32/20≤c2
С1=1
f(n)=Ω(g1(n))

lim
(
4 log n ❑
2
n → ∞ log n
=0 )
f(n)=ω(g1(n))

√(log n) 2√ (2 log n)

f(n) =√ (log n)
g(n) = 2√ (2 log n)
c1*2√ (2 log n)≤√ (log n) ≤c2*2√ (2 log n)

c1≤
√(log n) ≤c2
2 √(2 log n)
n0=16 => c1≤
√2 ≤c2
4
n0=32 => c1≤
√2 ≤c2
4

c1≤const≤c2
f(n)=θ(g(n))