This textbook on algorithms presents the fundamental algorithms and conveys the principles of algorithm analysis and design. An introductory chapter provides the necessary basic concepts from theoretical computer science, stochastic processes, and complexity analysis. The following chapters cover the areas of sorting and selection, hashing, dynamic programming, greedy algorithms, algorithms on graphs, optimized searching in trees, data compression, as well as algebraic algorithms, string matching, and heuristics. The final chapter discusses the most efficient algorithms for the satisfiability problem in propositional logic. Prof. Schöning succeeds in providing a lively and comprehensible overall presentation of algorithms through his clear style, numerous examples, and the demonstration of interconnections.