Fibbonachi 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

Fibbonachi 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

0 vote169 views1 answer
Django get latest object
Python Django
3 votes180 views2 answers
Python remove all occurrence of an items from list
Python
0 vote167 views4 answers
Pip django graphql
Python Django
2 votes141 views2 answers
Python index for all matches
Python
17 votes137 views2 answers
Return count of unique values pandas
Python
3 votes136 views5 answers
Calc
Python
2 votes149 views2 answers
Conditional row delete pandas
Python
0 vote152 views1 answer
Numpy savetext in one line
Python
0 vote144 views1 answer
Clicking items in selenium
Python
0 vote146 views1 answer
Euclidean algorithm recursive python
Python