"To understand recursion you need to first understand recursion"
# Tail recursion
Split the problem into smaller problems
fibonacci(n) = fibonacci(n - 1) + fibonacci(n - 2)
By Hack Bulgaria
Programming 101 with Python / week 8 / 17.04.2019
github.com/HackBulgaria