# 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))
def rec(num):
if num <= 1:
return 1
else:
return num + rec(num - 1)
print(rec(50))
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))
import random
def guess(a,b):
x = random.randint(a,b)
return x
def check(x,y):
if y ** 2 == x:
return True
return False
x = 100
left, right = 0, x
y = guess(left, right)
while not check(x,y):
y = guess(left, right)
print(y)
void A(n){
if(n>1) // Anchor condition
{
return A(n-1);
}
}
# Recursive function factorial_recursion()
def factorial_recursion(n):
if n == 1:
return n
else:
return n*factorial_recursion(n-1)
# 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))
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
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))