Algorithmics for beginners. For students, teachers and pupils of the subjects of mathematics and informatics (Q380957)

This book presents a pleasant and informative introduction to algorithms as well as a short tour on computability and complexity theory. It starts off with a chapter discussing what an algorithm in fact is, and then continues to describe a set of classical algorithms that everyone must have been confronted with sooner or later. Starting with two Monte Carlo algorithms (for determining pi and checking primality), it discusses sorting, Dijkstra's shortest path algorithm, RSA, Towers of Hanoi and so forth. The efficiency of algorithms is discussed using matrix multiplication and sorting, culminating in a short introduction to complexity theory. The book concludes with a chapter on Turing machines and computability. Each chapter contains a set of exercises whose solutions are provided at the end of the book (Chapter 6). All problems are introduced with a historical note; it is is nice to read the origins of problems and their solution, as well as to learn a bit about the life of some of the researchers that influenced this field. All in all, a book that is nice to read. It is indeed what it is supposed to be -- a gentle introduction to algorithmics. For a review of the first edition see [Zbl 1037.68156].