000			03145cam a22002298i 4500
999			_c32638 _d32638
001			19868014
010			_a 2017016319
020			_a9781498735285
040			_aUOWD
082	0	0	_a005.1 RU IN
100	1		_aRubio Sánchez, Manuel _910841
245	1	0	_aIntroduction to recursive programming / _cManuel Rubio-Sanchez
260			_aBoca Raton : _bCRC Press, Taylor & Francis Group, _c2017.
300			_axxxix, 410 p. : _bill. ; _c24 cm.
505			_aBasic Concepts of Recursive Programming Recognizing Recursion Problem DecompositionRecursive Code Induction Recursion Vs. IterationTypes of Recursion Exercises Methodology for Recursive Thinking Template for Designing Recursive AlgorithmsSize of The Problem Base Cases Problem Decomposition Recursive Cases, Induction, And DiagramsTesting Exercises Runtime Analysis of Recursive Algorithms Mathematical Preliminaries Computational Time ComplexityRecurrence RelationsExercises 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 FractalsSwamp 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.
520			_aRecursion 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.
650		0	_aRecursive programming _vTextbooks _910842
650		0	_aComputer programming _vTextbooks _910843
650		0	_aComputer algorithms _vTextbooks _910844
856			_uhttps://uowd.box.com/s/uvqpalghdnyg3zrptbg7kanhq4bnfrax _zLocation Map
942			_2ddc _cREGULAR