This is a block seminar on sorting algorithms open to computer science and data science students of all levels, including bachelor and master students.

Contents

Searching and sorting are key building blocks of working with data, and they are in ubiquitous use in software frameworks and databases. In this seminar, we will look at classical results and recent developments around sorting, ranging from novel theoretical insights to concrete implementations in industrial code bases. The seminar is offered jointly by the Database Systems and Algorithms Groups of Prof. Seeger and Prof. Wild who have published in this area extensively.

Students should bring a solid foundation in algorithms and programming at the level of our introductory modules, but sorting algorithms are otherwise a very accessible entry point to the world of algorithms.

Registration

Registration is on ILIAS. Topics will be assigned in a kickoff meeting.

Assessment

The module mark consists of the weighted average of an oral presentation (1LP) and a written report (2LP) about the seminar topic.

Relevant modules