Algorithms are the core of any non-trivial application of computers, and algorithmics is a modern and active field of computer science. Therefore, every computer scientist should be familiar with the fundamental algorithmic tools. These include structures for the efficient organization of data, commonly used algorithms, and standard techniques for modeling, understanding, and solving algorithmic problems. This book provides a concise introduction to the world of these fundamental tools, aimed at students and professionals who are familiar with programming and the basic elements of the language of mathematics. The individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversals, and shortest paths.