Recursion simply means “self reference”. When something refers to itself or describes itself, it is called recursive.
“This sentence is recursive.”
This picture is also recursive:
In programming, recursive function is a function that calls itself.
Let’s say you and your friends have ordered pizza, and now you want to cut it into equal slices. To do that you cut it in half, then you cut the resulting slices in half, and keep going until there’s enough slices for everyone.
In code, it would look like this:
This function takes the number of friends in the room(15), and a number of slices of pizza(initially 1). It cuts pizza in half:
number_of_slices = number_of_slices*2
and checks if there’s enough of the slices now. If yes — it just returns the number of resulting slices, if not — it calls itself again, to cut the pizza in half one more time.
Recursive functions can be hard to think about, but there’s a whole class of problems in Computer Science that are much easier solved by using this kind of algorithms. For example it can be used for binary search, for finding a factorial of a number, or for creating a system of nested comments like on reddit.
Receive must-read news, resources, and tips that will help you to build and grow your startup: https://startuplab.io/newsletter