Efficient algorithms and data structures are a central topic in computer science. Both subjects are inextricably linked, as algorithms operate on data structures, and data structures, in turn, contain algorithms as components. This book provides fundamental solution methods for the most important problem areas when working with data structures and algorithms. Readers will learn to design new algorithms and analyze their costs in terms of runtime and memory usage. The authors introduce programming language concepts for data structures and explain data types that serve as building blocks for implementing complex algorithms and data structures. In addition to presenting sorting algorithms and graphs, the book highlights special topics with chapters on geometric algorithms and techniques for shortest path searches using contraction hierarchies.