Enrollment no:202203103520021

PRACTICAL – 1
Aim: Find Factorial of a given number using Recursive and
Iterative methods. Calculate execution time:
A. GCD algorithm
B. Factorial algorithm
C. Fibonacci algorithm

1. Factorial number using recursive method :-

Code:-
def factorial(n):
if (n==1 or n==0) :
return 1
else:
return (n * factorial(n - 1))
num = 20
print("Factorial of 20 Recursive Method : ",factorial(num))

Output:-

2. Factorial number using iterative method :-

Code:-
n=int(20)
fact= 1
if n<0:
print("Invalid")
else:
for i in range(1,n+1):
fact=fact*i
Enrollment no:202203103520021

print("The factorial of iterative Mode ",n,"is", fact)

Output:-

3. Fibonacci Series numbers using recursion method:-

Code:-
def fib(n):
if(n <= 1):
return n
else:
return(fib(n-1) + fib(n-2))
n = 30
print("Fibonacci sequence For Recursive Mode:")
for i in range(n):
print(fib(i))

Output:-
Enrollment no:202203103520021

4. Fibonacci Series numbers using iterative method:-

Code:-
a=int(1)
b=int(2)
n=int(30)
print("Fibonacci Series numbers Interactive Method: ")
print(a,b,end=" ")
while(n-2):
c=a+b
a=b
b=c
print(c,end=" ")
n=n-1

Output:-

5. GCD numbers using recursion method

Code:-
print("GCD number Recursion Method:")
def hcf(a, b):
if(b==0):
return a
else:
return hcf(b , a % b)
a = 60
b = 48
print("The gcd of 70 and 58 is : ",end="")
print(hcf(70,58))
Enrollment no:202203103520021

6. GCD numbers using iterative method:-

Code:
import math
import time
print ("GCD numbers Interactive Method:")
start = time.time()
print("The gcd of 60 and 48 is : ", end="")
print(math.gcd(60,48))
end = time.time()
print(end - start)

Output: