This well-established textbook is aimed at students of computer science in both introductory and advanced studies. The individual algorithms are presented with a solid theoretical foundation; their functionality is explained in detail through numerous examples. In addition to the semi-formal descriptions, important algorithms are formulated in Java. The range of topics includes algorithms for searching and sorting, hash methods, trees, set manipulation, as well as geometric algorithms and graph algorithms. The book addresses both the design of efficient algorithms and data structures and the analysis of their behavior using mathematical methods. It is suitable for lecture support, self-study, and reference. A variety of exercises serves to further deepen the learned material. Java programs for the most important algorithms and supplementary material are included.