Module 47

Recursion

Functions that call themselves. The base case that stops the calls and the RecursionError when it's missing, recursive functions that return values (factorial, Fibonacci, sums of lists, reversed strings), and binary search done recursively.

Steps

1. A function that calls itself
2. Recursion that returns a value
3. Fibonacci, strings and lists
4. Binary search