FilesExpand file tree

 all-permutations

/

fibonacci_sequence_recursion.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

21 lines (17 loc) · 550 Bytes

 all-permutations

/

fibonacci_sequence_recursion.py

Top

File metadata and controls

• Code
• Blame

21 lines (17 loc) · 550 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

# Fibonacci Sequence Using Recursion

def recur_fibo(n):

if n <= 1:

return n

else:

(recur_fibo(n-1) + recur_fibo(n-2))

def isPositiveInteger(limit):

return limit >= 0

def main():

limit = int(input("How many terms to include in fibonacci series: "))

if isPositiveInteger(limit):

print("The first {limit} terms of the fibonacci series are as follows:")

print([recur_fibo(n) for n in range(limit)])

else:

print("Please enter a positive integer: ")

if __name__ == '__main__':

main()