Algorithms. Handbook with examples on C, C ++, Java and Python

If you think that the speed of solving a particular problem depends, first of all, on the power of the computer on which it is solved, then this book will become a revelation for you from the very first page. You will learn that the most contribution to the performance of the program makes a correctly selected algorithm and its implementation in the form of a computer program. The choice of a suitable algorithm among the mass of others that can solve your problem is not the simplest matter, and you will also learn this in this book.
The new edition describes many algorithms to solve problems from various fields, and you can choose and implement the most suitable algorithm for your tasks. Here, even completely unfamiliar with mathematics, the reader will find everything that is needed to understand and analyze the performance of the algorithm.
Written by professionals in their field, the book is worthy to take a place on the book shelf of any practicing programmer.
This book is amazing for three reasons: it is easy to find the necessary algorithms and structures of data, the style of presentation of the material is more spoken than academic, the reader’s attention is constantly focused on a comparative analysis of algorithm productivity. If you live in the real world, this book will forever change your method of using data structures.
Richard Reznik,
GQ Life Science Director
Effective algorithms are needed to create reliable software, but programmers rarely imagine the whole range of algorithms to solve their problems.
This updated edition describes existing algorithms for solving various problems. It helps to choose and implement an algorithm that is most suitable for your tasks, while providing sufficient mathematical justification for understanding and analyzing the productivity of the algorithm.
being focused on applications, and not on theory, this book is based on strict principles, including documented solutions to real problems in different programming languages. A dozen new algorithms implemented in Python, including the implementation of the Vorono diagrams, as well as the new chapter on spatial tree structures, such as R-Very and Quadtrees, were added to this publication.
In this book you will learn:
solve new problems and increase the effectiveness of existing solutions
quickly find algorithms to solve your problems and choose the most suitable
Find solutions in programming languages ​​C, C ++, Java, Python using recommendations from the book
Evaluate the productivity of algorithms and create conditions to achieve maximum efficiency
Use the most suitable data structures to increase the efficiency of algorithms
About the authors
George Heineman - Adjunct professor of computer science in WPI. In 2005, he was chairman of the International Symposium on Component-Oriented Software.
Gary Pollyis - professor of the Woster Polytechnic Institute, co -author of the book Head First Object -Oriented Analysis and Design.
Stanley Selkov taught for almost four decades at universities of Knoxville, Wuster, Montreal, Chunzin, Lausanne and Paris
2nd edition