Algorithms. Erickson J.

This manual contains basic information about the algorithms: various types of algorithms are analyzed, methods for their construction are considered (recursion, dynamic programming, etc.), and practical examples are given. At the end of each chapter, exercises are given aimed at consolidating the passed.

to study the material requires knowledge of the basics of discrete mathematics and methods of evidence, as well as the idea of ​​the main computational tasks and algorithms. Practical experience with programming language that supports indirect addressing and recursion is desirable.

The publication is addressed to students and teachers of technical universities, as well as those who want to study the basics of algorithmization.