Slides for the Group 10 of the Algorithmics (A-GEI) course Fall 2025-2026 at FIB
1. Basic algorithmic concepts
Introduction and review (
with transitions
) (
without transitions
)
Selection (
with transitions
) (
without transitions
) (updated 30/09/2025)
Sorting (
with transitions
) (
without transitions
)
Backtracking (
with transitions
) (
without transitions
)
2. Greedy algorithms
First examples (
with transitions
) (
without transitions
)
Minimum spanning tree (
with transitions
) (
without transitions
)
3. Dynamic Programming
Basic examples (
with transitions
) (
without transitions
)
(updated 11/11/2025)
4. Flows in networks
5. Other algorithmic techniques
