veyepar: A Beginner's Guide to Tackling Recursion

Author(s):	Al Sweigart
Location	Suzanne Scharer
Date	jul Sat 28	Days Raw Files
Start	15:00	First Raw Start	14:54
Duration	0:120:0	Offset	0:05:52
End	17:00	Last Raw End	17:05
Chapters	00:00 0:03:30 0:11:17 0:41:16 1:11:16 1:31:34 1:32:19
Total cuts_time	99 min.

https://pyohio.org/2018/schedule/presentation/40/
raw-playlist raw-mp4-playlist encoded-files-playlist host archive tweet mp4 svg png

assets release.pdf A_Beginners_Guide_to_Tackling_Recursion.json
logs
Admin: episode episode list cut list raw files day marks day marks day image_files

State:
Locked:	clear this to unlock
Locked by:	user/process that locked.
Start:	initially scheduled time from master, adjusted to match reality
Duration:	length in hh:mm:ss
Name:	Video Title (shows in video search results)
Emails:	email(s) of the presenter(s)
Released:	has someone authorised pubication
Normalise:
Channelcopy:	m=mono, 01=copy left to right, 10=right to left, 00=ignore.
Thumbnail:	filename.png
Description:	Recursion has an intimidating reputation for being the advanced skill of coding sorcerers. But in this tutorial we look behind the curtain of this formidable technique to discover the simple ideas under it. If you've ever said or thought the words "recursion is confusing", this tutorial is for you. Through hands-on exercises in the interactive shell, we'll answer the following questions: * What is recursion, and when is it a good idea and bad idea to use it? * What are all the confusing ways that recursion is commonly taught? * What's a stack, and what's the call stack? * What are stack overflows, and how do we avoid them? * Do some problems require recursion? How do I transform recursive code into iterative code, and vice versa? * What are some common recusive problems in whiteboard coding interviews? * What is memoization and tail call optimization? * How do I draw that cool-looking fractal artwork using recursion? We'll cover a number of common recursive algorithms: * Factorial and Fibonacci calculation * Exponent calculation * The Towers of Hanoi * The flood fill algorithm * Binary search * Generating permutations and combinations This tutorial is for a wide range of developers. Beginners who only understand the basics of Python will be able to follow along. Experienced developers who have hoped no one would notice the recursive-coding gap in their knowledge will be able to breath with relief after taking this tutorial. All that is required is a willingness to learn, and a willingness to have the willingness to learn, and a willingness to have the willingness to have the willingness to learn, and... so on. ## Setup Instructions [https://inventwithpython.com/blog/2018/08/24/pyohio-2018-recursion-tutorial/](https://inventwithpython.com/blog/2018/08/24/pyohio-2018-recursion-tutorial/) markdown
Comment:	production notes