A recursion is when you make a function and call it inside of itself. The recursion has a condition, this condition is that the recursive function has to have an end (to terminate) in order to be in the program.
A common example of this is the fibonacci sequence:
Gilberto Rogel García
#mastery21 Use of recursion for repetitive algorithms by Gilberto Rogel García is licensed under a Creative Commons Attribution 4.0 International License.