1. Introduction. Time complexity. Asymptotic notation.
2. Data structures.
3. Recursive algorithms.
4. Dynamic programming.
5. Greedy algorithms.
6. Graph algorithms.
7. Graph algorithms (cont.).
8. Number theory.
9. Combinatorics.
10. Games.
11. Permutations and their usage for solving of puzzles.
12. Computational geometry.
2. Data structures.
3. Recursive algorithms.
4. Dynamic programming.
5. Greedy algorithms.
6. Graph algorithms.
7. Graph algorithms (cont.).
8. Number theory.
9. Combinatorics.
10. Games.
11. Permutations and their usage for solving of puzzles.
12. Computational geometry.