Here’s an example code in Python that shows recursion:
def factorial( n):.
if n == 0:.
return 1.
else:.
return n * factorial( n-1).
print( factorial( 5 )) # Output: 120.
This code specifies a function factorial that determines the factorial of an offered number n. The factorial of a number is the item of all favorable integers approximately and consisting of that number. For instance, the factorial of 5 is 5 x 4 x 3 x 2 x 1 = 120.
The factorial function utilizes recursion to determine the factorial. If n amounts to 0, it returns 1 (the base case). Otherwise, it calls itself with n-1 as the argument and multiplies the outcome by n (the recursive case).
Recursion is an effective idea that can be utilized to resolve lots of issues. Nevertheless, it is very important to utilize recursion with care, as it can result in stack overflow mistakes if not executed properly.