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: Alexander Apostolov
- Teaching assistant: Etienne Bamas
- Teaching assistant: Mateo Chapatte
- Teaching assistant: Buddhima Gamlath
- Teaching assistant: Paritosh Garg
- Teaching assistant: Xinrui Jia
- Teaching assistant: Hugo François Lepeytre
- Teaching assistant: Andreas Maggiori
- Teaching assistant: Aidasadat Mousavifar
- Teaching assistant: Navid Nouri
- Teaching assistant: Camille Ariane Ohlmann
