FilesExpand file tree

master

/

fibonacci.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (41 loc) · 1.34 KB

master

/

fibonacci.py

Copy path

Top

File metadata and controls

• Code
• Blame

52 lines (41 loc) · 1.34 KB

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

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

"""

This is a pure Python implementation of Dynamic Programming solution to the fibonacci

sequence problem.

"""

class Fibonacci:

def __init__(self) -> None:

self.sequence = [0, 1]

def get(self, index: int) -> list:

"""

Get the Fibonacci number of `index`. If the number does not exist,

calculate all missing numbers leading up to the number of `index`.

>>> Fibonacci().get(10)

[0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

>>> Fibonacci().get(5)

[0, 1, 1, 2, 3]

"""

difference = index - (len(self.sequence) - 2)

if difference >= 1:

for _ in range(difference):

self.sequence.append(self.sequence[-1] + self.sequence[-2])

return self.sequence[:index]

def main():

print(

"Fibonacci Series Using Dynamic Programming\n",

"Enter the index of the Fibonacci number you want to calculate ",

"in the prompt below. (To exit enter exit or Ctrl-C)\n",

sep="",

)

fibonacci = Fibonacci()

while True:

prompt: str = input(">> ")

if prompt in {"exit", "quit"}:

break

try:

index: int = int(prompt)

except ValueError:

print("Enter a number or 'exit'")

continue

print(fibonacci.get(index))

if __name__ == "__main__":

main()