Q:

python recursion example

# Recursive Factorial Example
# input: 5 
# output: 120 (5*4*3*2*1)
def factorial(x):
    if x == 1:
        return 1
    else:
        return (x * factorial(x-1))
1
def yourFunction(arg):
    #you can't just recurse over and over, 
    #you have to have an ending condition
    if arg == 0:
        yourFunction(arg - 1)
        
    return arg
3
# Reccursion in python 
def recursive_method(n):
    if n == 1:
        return 1 
    else:
        return n * recursive_method(n-1)
    # 5 * factorial_recursive(4)
    # 5 * 4 * factorial_recursive(3)
    # 5 * 4 * 3 * factorial_recursive(2)
    # 5 * 4 * 3 * 2 * factorial_recursive(1)
    # 5 * 4 * 3 * 2 * 1 = 120
num = int(input('enter num '))
print(recursive_method(num))

2

#reccursion_ iterative 

'''factorial n! - n* n-1*n-2..1'''

def fac_iterative_method(n):
    fac = 1
    for i in range(n):
        fac = (fac * (i+1))
        print('fac of',i+1,'=',fac)
        
number = int(input('enter the number'))
fac_iterative_method(number)
0

New to Communities?

Join the community