Showing posts with label factorial using recursion in python. Show all posts
Showing posts with label factorial using recursion in python. Show all posts

Monday, 16 October 2017

Factorial using Recursion in python

def fact_recurse(n):
        if n==1:
                return n
        else:
                return n*fact_recurse(n-1)
num=int(input("Enter an integer to find factorial : "))
if num<0:
        print("Factorial of negative numbers does not exist.")
elif num==0:
        print("Factorial of 0 is 1.")
else:
        print("Factorial of ",num," is ",fact_recurse(num))

Output


Python Program to find Fabonacci

fabtab={} def fabonacci(n):     fabtab[0]=0     fabtab[1]=1     for i in range(2,n+1):         fabtab[i]=fabtab[i-1]+fabtab[i-2]         ...