PY
py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
num = int(input())
#==============================
#common way
def fibonacci(n):
#complete the recursive function
if n <= 1:
return n
else:
return fibonacci(n - 1) + fibonacci(n - 2)
#for n in range(num):
# print(fibonacci(n))
#==============================
# recursive way
# f(n) = f(n-1) + f(n-2)
def fibonacci_forward(n, need_print=True):
if n <= 1:
fNum = n
if need_print:
print(fNum)
else:
fNumPrev2 = fibonacci_forward(n - 2, need_print and n == 2)
fNumPrev1 = fibonacci_forward(n - 1, need_print and n >= 2)
if need_print and n > 2:
print(fNumPrev1)
fNum = fNumPrev1 + fNumPrev2
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run