Learn To Solve It
Implement Fibonacci Series.
def fibo(n): if n == 0: return 0 if n == 1: return 1 return (fibo(n-2) + fibo(n-1)) print(fibo(0)) print(fibo(1)) print(fibo(2)) print(fibo(3)) print(fibo(4)) print(fibo(5)) print(fibo(6))
See also
Suggest a Code Improvement:algorithm_fibo.py
Suggest a better explanation for algorithm_fibo.rst
previous
Eratosthenes method to find primes
next
Factorial of a number - 2