/Python/Fibonacci sequence algorithm python

Fibonacci sequence algorithm python

Fibonacci series in python

#Recursive Solutions
def fibo(n):
  if n<=1: return 1
  return fibo(n-1)+fibo(n-2)

fibo(5)
#OUTPUT:
#120

Fibonacci sequence algorithm python

#Learnprogramo
Number = int(input("How many terms? "))
# first two terms
First_Value, Second_Value = 0, 1
i = 0
if Number <= 0:
print("Please enter a positive integer")
elif Number == 1:
print("Fibonacci sequence upto",Number,":")
print(First_Value)
else:
print("Fibonacci sequence:")
while i < Number:
print(First_Value)
Next = First_Value + Second_Value
# update values
First_Value = Second_Value
Second_Value = Next
i += 1

Source: learnprogramo.com

Similar codes

7 votes125 views1 answer
Learn python the hard way pdf
Python
0 vote79 views0 answer
Python
1 vote114 views1 answer
How to get prime numbers in a list in python using list comprehension
Python
0 vote209 views3 answers
Berlin
Python
8 votes115 views6 answers
Declare variable in python
Python
5 votes117 views1 answer
Trimming spaces in string python
Python
13 votes121 views6 answers
Python merge two dictionaries
Python
0 vote117 views1 answer
Python convert string to byte array
Python
1 vote121 views1 answer
How will you print space and stay on the same line in python
Python
7 votes126 views6 answers
Python hello world
Python