Algorithms and Data Structures

This lecture will familiarize you with a series of concrete algorithms, principles for algorithm design, and their complexity analysis. Topics covered include asymptotic notations, recursive equations, sorting and selection algorithms, hash methods, graph algorithms, dynamic programming, greedy methods, and algebraic and number-theoretic algorithms.

T.H. Cormen, C.E. Leiserson, R.L. Rivest: Introduction to Algorithms. MIT Press, 1990.

U. Schöning: Algorithms. Spectrum Academic Publishing, 2001.

Script on algorithms and data structures.

Practice problems and lecture materials will be made available through the Moodle learning platform.