Why my code does not work?

Question

Here is my code
https://code.sololearn.com/cGgzHqn6YYkh/?ref=app
I can't understand what's my mistake....

Answer 1

https://code.sololearn.com/cCxSIFuCz1UW/?ref=app

Try this one.....

Answer 2

Kind_Cat
Maybe this adjustment to your code might help to explain

Add up the nums and compare to result

# Created by Kind_Cat

num = int(input())
print(num,'\n')

def fibonacci(n):

if n == 0:
print(0)
return 0
elif n == 1:
print(1)
return 1
#print (fibonacci(n-1)+fibonacci(n-2))
return fibonacci(n-1)+fibonacci(n-2)

print(fibonacci(num))

Answer 3

Christian Duah Marfo well done, now can be easily redone in a recursive way ☺️

Answer 4

I updated my previous answer for more clarification.

Answer 5

Try this, it can be helpful

def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n-1)+fibonacci(n-2)

num = int(input())
for i in range(num):
print(fibonacci(i))

Answer 6

fibonacci(n) will keep calling it with same value . Maybe you meant to do n-1 and n-2

Answer 7

You're Russian too!

Answer 8

This can not be done with a recursive pure function.

recursive:
https://code.sololearn.com/czbSIG9KoN7H/?ref=app
pure:
https://code.sololearn.com/cK02jcB2GUjL/?ref=app

edited for clarification :
This function has to print a sequence of numbers, not just one number. In a recursive function with two recursion at one call, like this, the function may be executed twice for one input. So there has to be an out-of-function variable that determines if one output has already been printed. for example, f(6) calls f(5) and f(4); And f(5) calls f(4) separately. So if the function prints somthing for f(4), it prints it twice.
One solution is that our function have one output and be called multiple times. but it's no longer pure for our purpose.

Answer 9

Abhay i try it too. But it doesn't work

Answer 10

And I make it in that code now. But it still doesn't work

Answer 11

Agree, it's hard to understand the process of recursion versus iteration ☺️
My suggestion:
"1. Create a fibonacci function using a while loop.
2. Create any simple recursive function, for example, print 1,2,3".

Post your solutions here

Then together we will try to write a recursive function fibonacci 😉

Answer 12

Maybe, it will be easier... But I want to understand it

Answer 13

So you will understand after passing this path ☺️

Answer 14

But if you get a straight answer, you will never learn how to create a recursive function correctly.

Answer 15

Да! ☺️

Answer 16

Revision chapters to understand

Answer 17

I read all comments now. But nothing I see here help me

Answer 18

num = int(input())

def fibonacci(n):

if n == 0:
print(0) #you should not use print here
return 0
elif n == 1:
print(1) # no print required
return 1
else: # this else must be required , otherwise it will run with every iteration and become endless loop
return fibonacci(n-1)+fibonacci(n-2)

print(fibonacci(num))

here is edited code

https://code.sololearn.com/cD8Nmc10y4mH/?ref=app