COVID-19 Response at Fishpond.com.au

Introduction to Recursive Programming
By

Rating

Product Description
Product Details

Basic Concepts of Recursive Programming

Recognizing Recursion

Problem Decomposition

Recursive Code

Induction

Recursion Vs. Iteration

Types of Recursion

Exercises

Methodology for Recursive Thinking Template for Designing Recursive Algorithms Size of The Problem Base Cases Problem Decomposition Recursive Cases, Induction, And Diagrams Testing Exercises Runtime Analysis of Recursive Algorithms Mathematical Preliminaries Computational Time Complexity Recurrence Relations Exercises Linear Recursion I Arithmetic Operations Digits, Bits, And Strings Additional Problems Exercises Linear Recursion II: Tail Recursion Searching Algorithms for Lists
Partitioning Schemes The Quickselect Algorithm Bisection AlgorithmfFor Root Finding The Woodcutter Problem Euclid's Algorithm Exercises Multiple Recursion I: Divide and Conquer Is A List Sorted in Ascending Order? Sorting Majority Element in A List Fast Integer Multiplication Matrix Multiplication The Tromino Tiling Problem The Skyline Problem Exercises Multiple Recursion II: Puzzles and Fractals Swamp Traversal Towers of Hanoi Longest Palindrome Substring Fractals EXERCISES Counting Problems Permutations Variations with Repetition Combinations Staircase Climbing Manhattan Paths
Convex Polygon Triangulations Circle Pyramids Exercises Mutual Recursion Parity of A Number Strategic Games Rabbit Population Growth Water Treatment Plants Puzzle Cyclic Towers of Hanoi Grammars and Recursive Descent Parsers Exercises Program Execution Control Flow Between Subroutines Recursion Trees The Program Stack Memoization and Dynamic Programming Exercises Tail Recursion Revisited and Nested Recursion Tail Recursion Vs. Iteration Tail Recursion by Thinking Iteratively Nested Recursion Tail and Nested Recursion Through Function Generalization Exercises Backtracking Introduction Generating Combinatorial Entities The N-Queens Problem Subset Sum Problem Path Through a Maze The Sudoku Puzzle Knapsack Problem Exercises

#### Reviews

Recursion is a fundamental topic in computer science, but one that is frequently taught in a fragmented way as part of an introductory course and then set aside for such electives as discrete programming and difference equations. Rubio-Sanchez (Universidad Rey Juan Carlos, Spain) believes that there are better ways to approach a concept so powerfully connected to computation. His book provides a comprehensive and approachable treatment of recursive programming. The text contains mathematical proofs, as well as clear methods that students can follow to derive new results and expand their knowledge in areas the book may not cover. Many of the fundamental problems that recursion can solve are presented and discussed; more advanced problems are addressed through decomposition and analysis. The book also contains a section on algorithm analysis, which helps form the basis for more advanced material on computational complexity. This book is useful as a textbook for introductory programming courses when an instructor adopts a more fundamental approach than imperative programming, but it can also serve as a useful reference for those who wish to explore recursive programming on their own, or for algorithm designers in the industry. --L. Benedicenti, University of New Brunswick (CHOICE)