Babban matsala tare da shirye-shiryen jerin Fibonacci shine cewa ba daidai ba ne. Lambobi biyu na farko a cikin jeri koyaushe iri ɗaya ne, amma lambobi biyu masu zuwa ba koyaushe suke daidai ba. Wannan na iya haifar da matsala lokacin ƙoƙarin ƙirƙirar shirin don ƙididdige lamba ta gaba a cikin jerin.
def Fibonacci(n):
if n<0:
print("Incorrect input")
elif n==1:
return 0
elif n==2:
return 1
else:
return Fibonacci(n-1)+Fibonacci(n-2)
Wannan aikin maimaitawa ne don ƙirƙirar lambobin Fibonacci. Aikin yana ɗaukar shigarwar lamba, n, kuma yana dawo da lambar Fibonacci nth. Idan shigarwar bai kai 0 ba, yana buga saƙon kuskure. Idan shigarwar ta kasance 1 ko 2, tana mayar da lambar Fibonacci ta farko ko ta biyu, bi da bi. In ba haka ba, zai dawo da jimlar lambobin Fibonacci biyu da suka gabata.
Fibonacci
A cikin ilimin lissafi, Fibonacci jerin lambobi ne waɗanda ke farawa da 0 da 1, kuma suna ci gaba zuwa kowace lamba ta hanyar haɗa lambobi biyu da suka gabata tare. Sunan jerin suna bayan Leonardo Fibonacci, wanda ya gabatar da shi a cikin 1202.
jerin
Jeri shine tsarin bayanai mai ƙarfi a cikin Python. Suna ba ku damar adana ƙididdiga masu yawa a wuri guda, da samun dama gare su a jere.
Misali, zaku iya ƙirƙirar jerin lambobi ta amfani da aikin kewayo():
1, 2, 3, 4, 5
Hakanan zaka iya ƙirƙirar jeri na kirtani ta amfani da aikin kirtani():
"daya", "biyu", "uku", "hudu", "biyar"
