Grokking Algorithms

Algorithms are step-by-step instructions for solving problems, most of which have already been solved, tested by someone, and proven effective. The second edition of 'Grokking Algorithms' simplifies the study, understanding, and use of algorithms. In this book, you will find... simple and clear explanations, over 400 amusing illustrations, and dozens of examples. Reading it is the best way to unlock the full power of algorithms and prepare for programming interviews. Deep knowledge of mathematics is not required! You will learn about the main algorithms that allow you to speed up program performance, simplify code, and solve common programming problems. Start with sorting and searching, then develop your skills to tackle complex tasks such as data compression and artificial intelligence. Learn to compare the efficiency of different algorithms. The second edition includes new, more detailed descriptions of trees, NP-complete problems, and the example code has been updated to Python 3.

Author: Адитья Бхаргава

Printhouse: piter

Series: Programmer's Library

Age restrictions: 16+

Year of publication: 2026

ISBN: 9785446141722

Number of pages: 352

Size: 250х170х20 mm

Cover type: soft

Weight: 562 g

ID: 1685662

Algorithms are step-by-step instructions for solving problems, most of which have already been solved, tested by someone, and proven effective. The second edition of 'Grokking Algorithms' simplifies the study, understanding, and use of algorithms. In this book, you will find simple and clear explanations, over 400 amusing illustrations, and dozens of examples. Reading it is the best way to unlock the full power of algorithms and prepare for programming interviews. Deep knowledge of mathematics is not required! You will learn about the main algorithms that allow you to speed up program performance, simplify code, and solve common programming problems. Start with sorting and searching, then develop your skills to tackle complex tasks such as data compression and artificial intelligence. Learn to compare the efficiency of different algorithms. The second edition includes new, more detailed descriptions of trees, NP-complete problems, and the example code has been updated to Python 3.

In stock

€ 12.69

Will be delivered to United States on 24 April (Fr):

By courier

from € 38.94

In stock

€ 12.69