A function is like a box that packs some related functionality into a function for invocation. Other functions can be called inside the function, or the function itself can be called.
If a function calls the function itself internally, then this is the recursive function.
Let's give a simple example.
In mathematics we know the factorial of 100, 100!=1009998...321.
Break it apart, 100!=10099!,99!=9998!,98!=98*97!...
Then we define a function to calculate the factorial:
def fact (N): return N*fact (n-1)
The above function appears to be a number that multiplies by 1 of its small number, but does not stop. So we have to transform the above function so that it can stop when the n=1 is done.
def fact (n): if n==0: return 1 else: return n*fact (n-1)
Recursive functions can also be implemented in a circular manner. But recursive function logic is relatively simple. However, when using recursive functions, it is important to guard against excessive recursive function calls resulting in stack overflow.