Menu
I am trying to figure out what you call a function that references itself. Is this termed recursion? Or is it simply a self-referencing function?
846
A recursive function is a function that calls itself until it doesn't. And this technique is called recursion.
A recursive function is a function that calls itself one or more times in its body. Functions can also be mutually recursive, where one function is defined in terms of the second, or vice-versa. I've been programming for over 20 years without the need for recursion.
Recursive Function is a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms. Usually, we learn about this function based on the arithmetic-geometric sequence, which has terms with a common difference between them.
It is a recursive function. Direct recursion is when a function calls itself.
171
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
