New course! Every coder should learn Generative AI!
Try a free lesson0
ะะพัะตะผั ะบะพะด ะฝะต ัะฐะฑะพัะฐะตั? ะ ะตัะตะฝะพ. Solved.
ะะพัะตะผั ะดะฐะฝะฝัะน ะบะพะด ะฝะต ัะฐะฑะพัะฐะตั? ะฅะพัะตะป ะฒััะธัะปะธัั ะฟะพัะปะตะดะพะฒะฐัะตะปัะฝะพััั ัะธะฑะพะฝะฐััะธ ัะตะบัััะธะฒะฝะพ, ะฝะพ ะบะพะด ะฝะต ัะฐะฑะพัะฐะตั ะดะพะปะถะฝัะผ ะพะฑัะฐะทะพะผ. https://code.sololearn.com/c2KX0b7oKRMx/?ref=app
5 Answers
+ 2
n1 = 0
n2 = 1
sum = 0
def fibonacci(x):
global n1,n2,sum #using global values
if x == 10:
return x
else:
print(sum)
sum = n1 + n2
n1 = sum
n2 = n1 - n2
return fibonacci(x+1)
print(fibonacci(0))
Edit :
#๐_M_๐
#ะ ะฒัะทะพะฒะต ััะฝะบัะธะธ ะบะฐะถะดัะน ัะฐะท, ะบะพะณะดะฐ ะฒะฐัะธ ะทะฝะฐัะตะฝะธั n1, n2 ะฝะฐัะธะฝะฐัััั ั 0,1 ะฒ ะบะฐะถะดะพะผ ัะตะบัััะธะฒะฝะพะผ ะฒัะทะพะฒะต .. ะะพััะพะผั ะพะฑััะฒะปัะนัะต ะธั
ะณะปะพะฑะฐะปัะฝะพ ะธะปะธ ะฟะตัะตะดะฐะฒะฐะนัะต ะพะฑะฝะพะฒะปะตะฝะฝัะต ะทะฝะฐัะตะฝะธั ะฒ ัะตะบัััะธะฒะฝัั
ะฒัะทะพะฒะฐั
..
(translated this)
In function call every time your n1, n2 values are starting from 0,1 in each recursive callings.. So declare those globally or pass updated values in recursive callings..
In passing way do like : def fibonacci(n1, n2, x) :
+ 1
I updated with explanations, hope you understand it..
๐_M_๐ you're welcome..
+ 1
In your function defination, functions get executed from start line line: def fibonacci(x) : to end line sequentially, and your 1st 3lines n1=0,n2=1,sum=0 will be executed every time you call it first. Even in recursive calls also these will be execution first so n1, n2,sum updated values gets resetted. So you shloud pass updated values like you passing x value (updated x as x+1).. Or use global values...
hope it clears..
0
Jayakrishna๐ฎ๐ณ,
Thank you very much!
0
Jayakrishna๐ฎ๐ณ,
I have one question. Why are the values not updated in recursive calls? They should be updated, it is logical.