| Description |
xxiv, 303 pages : illustrations ; 24 cm |
| Bibliography |
Includes bibliographical references and index. |
| Contents |
Introduction -- Understanding recursion. What is recursion? ; Recursion vs. iteration ; Classic recursion algorithms ; Backtracking and tree traversal algorithms ; Divide-and-conquer algorithms ; Permutations and combinations ; Memoization and dynamic programming ; Tail call optimization ; Drawing fractals -- Projects. File finder ; Maze generator ; Sliding-tile solver ; Fractal art maker ; Droste maker. |
| Summary |
"This book introduces the basics of recursion, exposing the ways it's often poorly taught and clarifying the fundamental principles of all recursive algorithms. Using Python and JavaScript examples, the book shows readers when to use recursive functions, how to implement the classic recursive algorithms often brought up in job interviews, and how recursive techniques can help solve countless problems involving tree traversal, combinatorics, and other tricky topics"-- Provided by publisher. |
| Subject |
Computer programming.
|
|
Recursion theory.
|
|
Python (Computer program language)
|
|
JavaScript (Computer program language)
|
| ISBN |
9781718502024 |
|
1718502028 |
|
More Resources