By Π ΡΠ±ΠΈΠΎ-Π‘Π°Π½ΡΠ΅Ρ Π.
Π ΡΠ±ΠΈΠΎ-Π‘Π°Π½ΡΠ΅Ρ Π., 2019
ΠΡΠ° ΠΊΠ½ΠΈΠ³Π° ΠΏΡΠ΅Π΄Π»Π°Π³Π°Π΅Ρ Π΄Π΅ΡΠ°Π»ΡΠ½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· ΡΠΈΡΠΎΠΊΠΎΠ³ΠΎ ΡΠΏΠ΅ΠΊΡΡΠ° Π²ΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½ΡΡ Π·Π°Π΄Π°Ρ, ΡΠ»ΡΠΆΠ° ΡΡΠΊΠΎΠ²ΠΎΠ΄ΡΡΠ²ΠΎΠΌ Π΄Π»Ρ ΡΠ΅Ρ , ΠΊΡΠΎ ΡΡΡΠ΅ΠΌΠΈΡΡΡ ΠΎΡΠ²ΠΎΠΈΡΡ ΡΠ΅ΠΊΡΡΡΠΈΠ²Π½ΠΎΠ΅ ΠΌΡΡΠ»Π΅Π½ΠΈΠ΅ ΠΈ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅. Π Π½Π΅ΠΉ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°ΡΡΡΡ ΡΠ°ΡΠΏΡΠΎΡΡΡΠ°Π½Π΅Π½Π½ΡΠ΅ ΡΠΈΠΏΡ ΡΠ΅ΠΊΡΡΡΠΈΠΈ, ΡΠ°ΠΊΠΈΠ΅ ΠΊΠ°ΠΊ Π»ΠΈΠ½Π΅ΠΉΠ½Π°Ρ, Ρ Π²ΠΎΡΡΠΎΠ²Π°Ρ ΠΈ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π΅Π½Π½Π°Ρ, Π° ΡΠ°ΠΊΠΆΠ΅ ΠΏΠ°ΡΠ°Π΄ΠΈΠ³ΠΌΡ ΡΠ°Π·ΡΠ°Π±ΠΎΡΠΊΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ², Π²ΠΊΠ»ΡΡΠ°Ρ Β«ΡΠ°Π·Π΄Π΅Π»ΡΠΉ ΠΈ Π²Π»Π°ΡΡΠ²ΡΠΉΒ» ΠΈ ΠΏΠ΅ΡΠ΅Π±ΠΎΡ Ρ Π²ΠΎΠ·Π²ΡΠ°ΡΠ°ΠΌΠΈ. ΠΠ°ΡΠ΅ΡΠΈΠ°Π» ΠΏΠΎΠ΄Ρ ΠΎΠ΄ΠΈΡ ΠΊΠ°ΠΊ Π΄Π»Ρ Π²Π²ΠΎΠ΄Π½ΡΡ , ΡΠ°ΠΊ ΠΈ Π΄Π»Ρ ΡΠ³Π»ΡΠ±Π»Π΅Π½Π½ΡΡ ΠΊΡΡΡΠΎΠ² ΠΏΠΎ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°ΠΌ.
M. Rubio-Sanchez, 2019
This book provides a detailed analysis of a wide range of computational problems, serving as a guide for those aiming to master recursive thinking and programming. It covers common recursion types like linear, tail, and multiple recursion, alongside algorithm design paradigms such as divide and conquer and backtracking. The content is suitable for both introductory and advanced programming and algorithm courses.