Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Recursion is one of the most fundamental concepts in computer science and a key programming technique that allows computations to be carried out repeatedly. Despite the importance of recursion for algorithm design, most programming books do not cover the topic in detail, despite the fact that numerous computer programming professors and researchers in the field of computer science education agree that recursion is difficult for novice students. Introduction to Recursive Programming provides a detailed and comprehensive introduction to recursion. This text will serve as a useful guide for anyone who wants to learn how to think and program recursively, by analyzing a wide variety of computational problems of diverse difficulty. It contains specific chapters on the most common types of recursion (linear, tail, and multiple), as well as on algorithm design paradigms in which recursion is prevalent (divide and conquer, and backtracking). Therefore, it can be used in introductory programming courses, and in more advanced classes on algorithm design. The book also covers lower-level topics related to iteration and program execution, and includes a rich chapter on the theoretical analysis of the computational cost of recursive programs, offering readers the possibility to learn some basic mathematics along the way. It also incorporates several elements aimed at helping students master the material. First, it contains a larger collection of simple problems in order to provide a solid foundation of the core concepts, before diving into more complex material. In addition, one of the book's main assets is the use of a step-by-step methodology, together with specially designed diagrams, for guiding and illustrating the process of developing recursive algorithms. Furthermore, the book covers combinatorial problems and mutual recursion. These topics can broaden students' understanding of recursion by forcing them to apply the learned concepts differently, or in a more sophisticated manner. The code examples have been written in Python 3, but should be straightforward to understand for students with experience in other programming languages. Finally, worked out solutions to over 120 end-of-chapter exercises are available for instructors.

Recursive programming --- Computer programming --- Computer algorithms

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematical logic --- Combinatory logic. --- Lambda calculus. --- Recursive programming. --- Logique mathématique --- Logique générale --- Logique combinatoire --- Lambda-calculus

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Data structures (Computer science) --- Sorting (Electronic computers) --- Recursive programming --- Linear programming --- Computer sorting --- Electronic data processing --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Economics --- Recursive programming. --- Mathematical models. --- Recursive programming --- Programmation récursive --- -Wiskundige economie. Wiskundige methoden in de economie --- -330.115.001.57 Econometrische modellen. Simulatiemodellen --- Programmation récursive --- 330.3 --- AA / International- internationaal --- 330.105 --- 330.115.001.57 --- Linear programming --- Economics, Mathematical --- 330.115.001.57 Econometrische modellen. Simulatiemodellen --- Econometrische modellen. Simulatiemodellen --- 330.105 Wiskundige economie. Wiskundige methoden in de economie --- Wiskundige economie. Wiskundige methoden in de economie --- Mathematical models --- Methode in staathuishoudkunde. Statische, dynamische economie. Modellen. Experimental economics --- Operational research. Game theory --- Quantitative methods (economics) --- Economie politique --- Modèles mathématiques --- Economics - Mathematical models

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer programming --- Recursive programming --- 681.3*F3 --- 681.3*F41 --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- Logics and meanings of programs (Theory of computation) --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- 681.3*F41 Mathematical logic: computability theory computational logic lambda calculus logic programming mechanical theorem proving model theory proof theoryrecursive function theory--See also {681.3*F11} {681.3*I22} {681.3*I23} --- Mathematical logic: computability theory computational logic lambda calculus logic programming mechanical theorem proving model theory proof theoryrecursive function theory--See also {681.3*F11} {681.3*I22} {681.3*I23} --- Programming --- Linear programming --- Coding theory --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Computer science