Exercises:
Introduction. Time complexity. Asymptotic notation.
Data structures.
String algorithms.
Backtracking.
Dynamic programming.
Greedy algorithms.
Graph travelsal.
Other graph algorithms.
Number theory.
Combinatorics.
Games. Algorithms for finding winning strategies.
Permutations and their usage for solving of puzzles.
Computational geometry.
Introduction. Time complexity. Asymptotic notation.
Data structures.
String algorithms.
Backtracking.
Dynamic programming.
Greedy algorithms.
Graph travelsal.
Other graph algorithms.
Number theory.
Combinatorics.
Games. Algorithms for finding winning strategies.
Permutations and their usage for solving of puzzles.
Computational geometry.