Students get an overview about algorithmic solutions for some fundamental problems as e.g. sorting or tree-balancing. Further, they get an introduction into the field of "complexity theory". Participants shall get an understanding into what problem classes are computational solvable and what classes are perceived as unsolvable.