Skip to main content

#mastery21 Use of recursion for repetitive algorithms

1 min read

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