Study and use of recursive algorithms in computer science teacher training

The article substantiates the importance of studying recursion by students of the 44.03.05 Pedagogical education profile of Informatics, as well as by students of the second and ninth enlarged groups associated with IT areas. The works of Esayan A.R. are analyzed, which form the methodological and theoretical basis for teaching students of the Tula State Pedagogical University in the field of construction and use of recursive algorithms. An overview of current research in the field of the formation and development of the mathematical culture of future teachers and specialists in IT areas through the study of recursion, methodological features of the study of recursive algorithms as the basis for the development of the worldview and research skills of students, examples of the effectiveness of the use of recursive constructions and functions in solving practice-oriented tasks.
The authors describe the logic of studying the basics of recursion, the principles for selecting the content necessary for the study of this topic by future teachers and specialists in IT areas. The proposed content of the classes is based not only on the theoretical study of the basic concepts of this subject area, but also on the consideration of convincing irrefutable evidence of the existence and beauty of recursive objects of various nature. The study of practical material is proposed to be built in accordance with the didactic principle "from simple to complex": from the simplest recursive algorithms for perception to efficient sorting and search algorithms on dynamic data structures. This approach, according to the authors, allows students to evaluate the significance and effectiveness of recursive methods of information processing and form professional competencies in the development and application of optimal algorithms for solving practice-oriented problems.