Recursion is the process in which a function calls itself. The example is the Fibonacci sequence that defined as: F(x) = F(x-1) + F(x-2). This slide is intended for people who will learn recursion in Python. We hope it can help you to understand about recursion.