You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
23 lines
612 B
Python
23 lines
612 B
Python
5 years ago
|
# Python program to display the Fibonacci sequence up to n-th term using recursive functions
|
||
|
|
|
||
|
|
def recur_fibo(n):
|
||
|
|
"""Recursive function to
|
||
|
|
print Fibonacci sequence"""
|
||
|
|
if n <= 1:
|
||
|
|
return n
|
||
|
|
else:
|
||
|
|
return(recur_fibo(n-1) + recur_fibo(n-2))
|
||
|
|
|
||
|
|
# Change this value for a different result
|
||
|
|
nterms = 10
|
||
|
|
|
||
|
|
# uncomment to take input from the user
|
||
|
|
#nterms = int(input("How many terms? "))
|
||
|
|
|
||
|
|
# check if the number of terms is valid
|
||
|
|
if nterms <= 0:
|
||
|
|
print("Plese enter a positive integer")
|
||
|
|
else:
|
||
|
|
print("Fibonacci sequence:")
|
||
|
|
for i in range(nterms):
|
||
|
|
print(recur_fibo(i))
|