--Originally published at Luis Santana's Blog
Continuing this long marathon of posts, next topic will be use of recursion for repetitive algorithms.
According to Lepe in 2015, he says (and I completely agree, there’s wisdom in his words). “Recursion is a way of programming in wich you use the same function in a function”. That means it calls itself one or more times in its body. Usually, it is returning the return value of this function call. If a function definition fulfils the condition of recursion, we call this function a recursive function.
Here’s a good example, actually the best example I could find:
