Ingxaki ephambili yokucwangcisa ulandelelwano lweFibonacci kukuba ayilulo ulandelelwano oluchanekileyo. Amanani amabini okuqala ngokulandelelana ahlala efana, kodwa amanani amabini alandelayo awasoloko elingana. Oku kunokubangela iingxaki xa uzama ukwenza inkqubo yokubala inani elilandelayo ngokulandelelana.
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)
Lo ngumsebenzi ophindaphindayo wokuvelisa amanani eFibonacci. Umsebenzi uthatha igalelo elipheleleyo, n, kwaye ibuyisela inani le-nth Fibonacci. Ukuba igalelo lingaphantsi kuka-0, iprinta umyalezo wemposiso. Ukuba igalelo ngu-1 okanye 2, ibuyisela inombolo yokuqala okanye yesibini yeFibonacci, ngokulandelanayo. Kungenjalo, ibuyisela isixa samanani amabini adlulileyo eFibonacci.
Fibonacci
Kwimathematika, iFibonacci lulandelelwano lwamanani oluqala ngo-0 no-1, kwaye luye kwinani ngalinye elilandelelanayo ngokudibanisa amanani amabini angaphambili kunye. Ulandelelwano luthiywe ngoLeonardo Fibonacci, owathi wayizisa ngo-1202.
Ukulandelelana
Ulandelelwano luluhlu olunamandla lwedatha kwiPython. Bakuvumela ukuba ugcine amaxabiso amaninzi kwindawo enye, kwaye ufikelele kubo ngokulandelelana.
Umzekelo, ungenza ulandelelwano lwamanani usebenzisa uluhlu () umsebenzi:
1, 2, 3, 4, 5
Unokwenza kwakhona ulandelelwano lweentambo usebenzisa umtya () umsebenzi:
"nye mbini ntathu ne ntlanu"
