https://inventwithpython.com/recursion/

 Invent with Python

  * Read for Free
    Automate the Boring Stuff with Python The Big Book of Small
    Python Projects Beyond the Basic Stuff with Python Coding with
    Minecraft Cracking Codes with Python Invent Your Own Computer
    Games with Python Making Games with Python & Pygame Scratch
    Programming Playground
  * Buy Books
    Automate the Boring Stuff with Python The Big Book of Small
    Python Projects Beyond the Basic Stuff with Python Coding with
    Minecraft Cracking Codes with Python Invent Your Own Computer
    Games with Python Making Games with Python & Pygame Scratch 3
    Programming Playground
  * Udemy Courses
    Automate the Boring Stuff with Python Beyond the Basic Stuff with
    Python Scratch Programming Playground
  * YouTube
  * Subreddit
  * Blog
  * Donate

The Recursive Book of Recursion

                            [cover_recu]

   Buy Direct From Publisher (Preferred, Free Ebook) Buy on Amazon

Ace the Coding Interview with Python and Javascript

Recursion, and recursive algorithms, have a reputation for being
intimidating. They're seen as an advanced computer science topic
often brought up in coding interviews. Moreover, coders often
perceive the use of a recursive algorithm as a sophisticated solution
that only true programmers can produce. But there's nothing magical
about recursion. Its fearsome reputation is more a product of poor
teaching than of the complexity of recursion itself.

This book teaches the basics of recursion, exposes the ways it's
often poorly taught, and clarifies the fundamental principles behind
all recursive algorithms. It is project-based, containing complete,
runnable programs in both Python and JavaScript, and covers several
common recursive algorithms for tasks like calculating factorials,
producing numbers in the Fibonacci sequence, tree traversal, maze
solving, binary search, quicksort and merge sort, Karatsuba
multiplication, permutations and combinations, and solving the eight
queens problem.

The book also explains tail call optimization and memoization,
concepts often employed to produce effective recursive algorithms,
and the call stack, which is a critical part of how recursive
functions work but is almost never explicitly pointed out in lessons
on recursion. The last chapter, on fractals, culminates with examples
of the beautiful fractal shapes recursion can produce.

Publisher: William Pollock, Production Manager: Rachel Monaghan,
Production Editor: Miles Bond, Developmental Editor: Frances Saux,
Cover Illustrator: James L. Barry, Interior Design: Octopod Studios,
Technical Reviewer: Sarah Kuchinsky, Copyeditor: Sharon Wilkey,
Compositor: Maureen Forys, Happenstance Type-O-Rama, Proofreader:
Audrey Doyle

Buy Direct From Publisher (Preferred, Free Ebook) Buy on Amazon

Downloads & Online Tools

  * Online diff tool to compare your code to the code in this book.

Read the Book Online

The book will be posted here in full under a Creative Commons license
when it's released.

  * Front Matter
  * Introduction
  * Chapter 1 - What Is Recursion?
  * Chapter 2 - Recursion vs. Iteration
  * Chapter 3 - Classic Recursion Algorithms
  * Chapter 4 - Backtracking and Tree Traversal Algorithms
  * Chapter 5 - Divide-and-Conquer Algorithms
  * Chapter 6 - Permutations and Combinations
  * Chapter 7 - Memoization and Dynamic Programming
  * Chapter 8 - Tail Call Optimization
  * Chapter 9 - Drawing Fractals
  * Chapter 10 - File Finder
  * Chapter 11 - Maze Generator
  * Chapter 12 - Sliding-Tile Solver
  * Chapter 13 - Fractal Art Maker
  * Chapter 14 - Droste Maker

Receive a Free Review Copy

If you'd like to receive a free print copy of The Recursive Book of
Recursion, please fill out the form at https://forms.gle/
PeNCD3qz5SY14tJo8. You'll receive a free ebook to read, and upon
posting a review to Amazon, you will receive a complementary print
review copy of the book. (UPDATE: There's been a large amount of
interest, and I can't guarantee you'll get a print book. However, I
can definitely send you an ebook to review.)

Please post an honest review. Posting a negative review will not
impact whether or not you get a free print book. The only
requirements are that the review be a minimum of 100 words, you must
live within the United States (due to shipping costs), you must have
purchased $50 off Amazon in the last year (Amazon has this
requirement before you can write a review), and that you email me
first before writing the review.

-->

Copyright 2009- | [email protected] | @AlSweigart

Black Lives Matter Trans Rights Are Human Rights Tax the Rich

BLACK LIVES MATTER | TRANS RIGHTS ARE HUMAN RIGHTS | TAX THE RICH