Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Fiboncaci series in recursion
#python 3.6.9 def recur_fibo(n): if n <= 1: return n else: return(recur_fibo(n-1) + recur_fibo(n-2)) nterms = 10 # check if the number of terms is valid if nterms <= 0: print("Plese enter a positive integer") else: print("Fibonacci sequence:") for i in range(nterms): print(recur_fibo(i))
run
|
edit
|
history
|
help
1
default argument
Faiha - Lesson 8
max min diff list
yield from example
Hesap makinesi
PyTeleAbs
ass
IP Network & Broadcast Address Calculator 2
(P3) Zadanie Kolokwium 2013: Trójkąty i trójkąty
Сумма цифр пятизначного числа