Linkovi na nasp ZI
- Knapsack
- Dijkstra Algorithm
- Bellman Ford Algorithm
- WFI Algorithm
- 2-MST (auditorne 2.8)
- Dijkstra MST (auditorne 2.8)
- Prim MST Algorithm
- problem kineskog postara
- Bondy-Chvatal
- 0-1 knapsack FPTAS (auditorne 2.9.2)
- linearni kongruentni generatori (Auditorne 2.11)
x_(n+1) = (a*x_n + c) mod m
- skip liste