Recursion in Programming...

In this article, I want to explain you about the meaning of recursion in programming.

When a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. Some problems, Using a recursive algorithm, certain problems can be solved quite easily. A recursive function solves a particular problem by calling a copy of itself and solving smaller subproblems of the original problems. Recursive calls can be generated as many times as necessary.

For example, the next C function returns the variable x raised to the power of the variable y (x ^ y). This function will be called itself until "y" is equal to zero, all number elevated to 0 is equal to 1, so this is the final stage for recursive function. In the last stage, we could say that the unknown value is now known, so this value complete the previous function and so on.

Here is a diagram created to illustrate the way the process of our recursive function _pow_recursion() is completed on the stack. (For this example, we will execute the function with 2 as the value of "x" and 5 as the value of "y"):

I hope this article was helpful to you and increased your understanding of the concept of recursion.

Definitions Source: https://www.geeksforgeeks.org/recursion/