Sample Output:
12 30
sum_series(6)=6 + sum_series(4)
sum_series(6)=6 + 4+sum_series(2)
sum_series(6)=6 + 4+sum_series(2)
sum_series(6)=6 + 4+2+0
Monday, June 29, 2020
Write a Python program to calculate the sum of the positive integers of n+(n-2)+(n-4)... (until n-x =< 0).
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2)
print(sum_series(6))
print(sum_series(10))
Python Recursive Function for Fibonacci Sequence
def fibo(n):
if n == 1 or n == 2:
return 1
else:
return (fibo(n - 1) + (fibo(n - 2)))
print(fibo(7))
Explanation:
fibo(7)=fibo(6)+fibo(5)
fibo(7)=(fibo(5)+fibo(4))+(fibo(4)+fibo(3))
fibo(7)=(fibo(4)+fibo(3)+fibo(3)+fibo(2)+fibo(3)+fibo(2)+fibo(2)+fibo(1))
fib(7)=fibo(3)+fibo(2)+fibo(2)+fib(1)+fibo(2)+fib(1)+1+fibo(2)+fib(1)+1+1+1
fib(7)=fibo(2)+fib(1)+1+1+1+1+1+1+1+1+3
fib(7)=1+1+8+3
fib(7)=13
Python Recursive Program for Digit Addition of Integer's
def sumDigits(n):
if n == 0:
return 0
else:
return n % 10 + sumDigits(int(n / 10))
print(sumDigits(345))
print(sumDigits(45))
pyhton Recursive Program for Fcatorial Calculation
def factorial(n):
if n <= 1:
return 1
else:
return n * (factorial(n - 1))
print(factorial(5))
Python Recursive Program to sum Nested List Elements
def recursive_list_sum(data_list):
total = 0
for element in data_list:
if type(element) == type([]):
total = total + recursive_list_sum(element)
else:
total = total + element
return total
print( recursive_list_sum([1, 2, [3,4],[5,6]]))
Python Recursive Program to Convert number in Biniary ,Octal,Hexadecimal
def to_string(n,base):
conver_tString = "0123456789ABCDEF"
if n < base:
return conver_tString[n]
else:
return to_string(n//base,base) + conver_tString[n % base]
print(to_string(2835,16))
Write a Python program to calculate the sum of a list of numbers using Recursion
def list_sum(num_List):
if len(num_List) == 1:
return num_List[0]
else:
return num_List[0] + list_sum(num_List[1:])
print(list_sum([2, 4, 5, 6, 7]))
Subscribe to:
Posts (Atom)