In this course you will get familiar with the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, the design of algorithms by induction, Sorting and searching, Merge sort, quicksort, heapsort, binary search, graph algorithms and data structures, graph traversals, shortest paths, spanning trees, matching, network flows, and elements of the theory of NP-completeness.
- Professor: Ola Nils Anders Svensson
- Teaching assistant: Etienne Bamas
- Teaching assistant: Sébastien Alexis Andrew Chahoud
- Teaching assistant: Akash Balasaheb Dhasade
- Teaching assistant: Marina Drygala
- Teaching assistant: Grzegorz Adam Gluch
- Teaching assistant: Andreas Maggiori
- Teaching assistant: Mikhail Makarov
- Teaching assistant: Nicolas Pierre Ante Matekalo
- Teaching assistant: Sai Ganesh Nagarajan
- Teaching assistant: Camille Ariane Ohlmann
- Teaching assistant: Alexandre Yohann Riou
