Časovna zahtevnost 2.kol Flashcards

(21 cards)

1
Q

Inicializacija

A

T(n) = O(|V|)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

operaciji vstavljanja in izločanja iz vrste/sklada za eno vozlišče

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

operaciji vstavljanja in izločanja iz vrste/sklada za vsa vozlišča

A

O(|V|)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

graf – seznami sosedov

A

T(n) = O(|V| + |E|)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

graf – matrika sosednosti

A

T(n) = O(|V|²)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

zmanjša za konstantni faktor

A

O(log₂ n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Evklidov algoritem

A

o(log₂(min(a, b)))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

urejanje z vrivanjem – zaporedje nepadajoče

A

T(n) = Ω(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

urejanje z vrivanjem – zaporedje padajoče in povprečno

A

T(n) = O(n²)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

preprosti problem nahrbtnika

A

T(n) = O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Primov algoritem

A

Θ(|V|²)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Dijkstrin algoritem (s poljem)

A

O(|V|²)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Dijkstrin algoritem (s kopico)

A

O(|E| · log₂ |V|)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Dijkstrin algoritem (s Fibonaccijevo kopico)

A

O(|V| · log₂ |V| + |E|)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Bellman-Fordov algoritem

A

O(|V| · |E|)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Problem trgovskega potnika

17
Q

Floyd–Warshall

18
Q

Bellman-Held-Karpov algoritem

A

T(n) = O(n² · 2ⁿ)

19
Q

optimalno dvojiško drevo

A

O(n³), lahko znižamo na O(n²)

20
Q

prostor rešitev (vračanje)

A

T(n) = O(p(n))

21
Q

Barvanje grafov

A

T(n) = O(n · mⁿ)