/Python/Python fibonacci series (Recursion)

Python fibonacci series (Recursion)

Input:

def Fib(n):
   if n <= 1:
       return n
   else:
       return (Fib(n - 1) + Fib(n - 2))  # function calling itself(recursion)


n = int(input("Enter the Value of n: "))  # take input from the user
print("Fibonacci series :")
for i in range(n):
   print(Fib(i),end = " ")

Output:

Enter the value of n:  8
0 1 1 2 3 5 8 13

Source: scaler.com

Similar codes

1 vote148 views1 answer
How to check if python has been added to path
Python
8 votes110 views2 answers
How do I set Conda to activate the base environment by default?
Python
0 vote134 views10 answers
C++ to python converter online
Python
0 vote131 views1 answer
Python Ordered dict to dict
Python
0 vote118 views1 answer
Fastest sorting algorithm java
Python
0 vote112 views1 answer
Python count how many times a word appears in a string
Python
1 vote135 views1 answer
Slack send message python
Python
0 vote122 views1 answer
Pandas convert string to numpy array
Python
1 vote121 views2 answers
End python print with space
Python
0 vote123 views1 answer
Linkedin dynamic scrolling using selenium python
Python