Read more
Recursion is an important problem-solving skill that is considered to be one of the most difficult topics to master by CS1/2 students. This book helps students assimilate its fundamental concepts by analyzing a large number of problems of different nature, covering classical problems found in the literature, as well as richer related problems.
List of contents
Basic Concepts of Recursive Programming. Methodology for Recursive Thinking. Runtime Analysis of Recursive Algorithms. Linear Recursion I. Linear Recursion II: Tail Recursion. Multiple Recursion I: Divide and Conquer. Multiple Recursion II: Puzzles and Fractals. Counting Problems. Mutual Recursion. Program Execution. Tail Recursion Revisited and Nested Recursion. Backtracking
About the author
Manuel Rubio-Sánchez received MS and PhD degrees in computer science from Universidad Politécnica de Madrid in 1997 and 2004, respectively. Since, he has had a faculty position at Universidad Rey Juan Carlos (Madrid, Spain), where he is currently an associate professor in the Superior Technical School of Computer Science. His teaching has focused on computer programming, ranging from introductory CS1 courses to more advanced courses on algorithms and data structures. He has published several research studies related to recursion in the computer science education conferences. His other research interests include machine learning, and exploratory data analysis and visualization. Finally, he has been a lecturer at St. Louis University (Madrid campus), and has carried out research visits at Université de Cergy-Pontoise (Paris), and the University of California, San Diego.
For more information on the author, please visit https://sites.google.com/view/recursiveprogrammingintro/.
Summary
Recursion is an important problem-solving skill that is considered to be one of the most difficult topics to master by CS1/2 students. This book helps students assimilate its fundamental concepts by analyzing a large number of problems of different nature, covering classical problems found in the literature, as well as richer related problems.
