How recursion works in python

Recursion in python

def rec(num):
    if num <= 1:
        return 1
    else:
        return num + rec(num - 1)

print(rec(50))

Recursion python examples

void A(n){
    if(n>1) // Anchor condition
    {
       return A(n-1);
    }
}

Source: datacamp.com

How recursion works in python

def factorial(x):
    """This is a recursive function
    to find the factorial of an integer"""

    if x == 1:
        return 1
    else:
        return (x * factorial(x-1))


num = 1
print("The factorial of", num, "is", factorial(num))

Source: programiz.com

What Is Python Recursive Function in python

 pythonCopydef fact(n):
    """Recursive function to find factorial"""
    if n == 1:
        return 1
    else:
        return (n * fact(n - 1))
a = 6
print("Factorial of", a, "=", fact(a))

Source: delftstack.com

Similar codes

1 vote288 views1 answer
How to count in a loop python
Python
0 vote298 views1 answer
Python why call super(class).__init__()
Python
1 vote347 views1 answer
How to create routes in flask
Python Flask
-2 votes316 views4 answers
Django datepicker
Python Django
0 vote292 views1 answer
Float value in regression expression python
Python
1 vote287 views1 answer
How to custom page not found in django
Python
7 votes289 views2 answers
Python encode comment
Python
0 vote278 views1 answer
Make white image numpy
Python
1 vote355 views2 answers
Tree python
Python
0 vote303 views1 answer
Write a Python program to get the Fibonacci series between 0 to 50. Note : The Fibonacci Sequence is the series of numbers
Python