Python Recursion
New Courses Coming Soon
Join the waiting lists
A function in Python can call itself. That’s what recursion is. And it can be pretty useful in many scenarios.
The common way to explain recursion is by using the factorial calculation.
The factorial of a number is the number n
mutiplied by n-1
, multiplied by n-2
… and so on, until reaching the number 1
:
3! = 3 * 2 * 1 = 6
4! = 4 * 3 * 2 * 1 = 24
5! = 5 * 4 * 3 * 2 * 1 = 120
Using recursion we can write a function that calculates the factorial of any number:
def factorial(n):
if n == 1: return 1
return n * factorial(n-1)
print(factorial(3)) # 6
print(factorial(4)) # 24
print(factorial(5)) # 120
If inside the factorial()
function you call factorial(n)
instead of factorial(n-1)
, you are going to cause an infinite recursion. Python by default will halt recursions at 1000 calls, and when this limit is reached, you will get a RecursionError
error.
Recursion is helpful in many places, and it helps us simplify our code when there’s no other optimal way to do it, so it’s good to know this technique.
Here is how can I help you:
- COURSES where I teach everything I know
- CODING BOOTCAMP cohort course - next edition in 2025
- THE VALLEY OF CODE your web development manual
- BOOKS 17 coding ebooks you can download for free on JS Python C PHP and lots more
- Interesting links collection
- Follow me on X