Who can write a recursive Python program for Fibonacci sequence 0,1,1,2,3,5,8,...?

Question

Please also check if the fibo(7) = 8

Answer 1

The correct answer is here:

#function
def fibonacci(n):
    if (n <= 0):
      return ("number should be positive")
    elif (n == 1): 
      return(0)
    elif (n == 2):
      return(1)
    else:
      sum = fibonacci(n-1) + fibonacci(n-2)
      return (sum)

#print result   
print(fibonacci(7))

Answer 2

#function
def fibonacci(n):
if n == 1 or n == 2:
return 1
else:
sum = n + fibonacci(n-1)
return sum

#print result
print(fibonacci(10))

https://repl.it/@soulwolf233/fibonacci-sequence

Comments

You should correct your code as follows:

sum = fibonacci(n-1) + fibonacci(n-2)