This guide contains basic information about algorithms: various types of algorithms are analyzed, methods for their construction are considered (recursion, dynamic programming, etc.), practical examples are given. At the end of each chapter, there are exercises aimed at consolidating the completed. To study the material requires knowledge of the basics of discrete mathematics and proof methods, as well as an understanding of basic computational problems and algorithms. Practical experience with a 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 learn the basics of algorithmization.