-
Notifications
You must be signed in to change notification settings - Fork 0
/
Fibonacci.py
150 lines (80 loc) · 2.04 KB
/
Fibonacci.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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
# -*- coding: utf-8 -*-
"""
Created on Sat Aug 11 21:17:58 2018
@author: sanooj
"""
"""
Fibonacci
"""
#( 1 + 1 + 2 + 3 )
"""
F(4) = 1 + 1 + 2 + 3 = 7
"""
#F(n+2) = F(n) + F(n+1)
def fibonacci(number:int):
sum = 0
seed_one = 1
seed_two = 1
fibonacci= []
for index in range(0,number):
print("index: %s sum: %s" %(index,sum))
if sum == 0:
sum = seed_one + seed_two
fibonacci += [seed_one , seed_two, sum]
else:
if number == len(fibonacci):
break
sum = seed_one + seed_two
fibonacci.append(sum)
seed_one = seed_two
seed_two = sum
print("sum %s" %(fibonacci))
sum = 0
for element in fibonacci:
sum += element
print("sum = %s" %(sum))
print(fibonacci(number=3)) #(1 + 1 + 2)
print(fibonacci(number=4)) #(1 + 1 + 2 + 3)
print(fibonacci(number=5)) #(1 + 1 + 2 + 3 + 5)
print(fibonacci(number=6)) #(1 + 1 + 2 + 3 + 5 + 8)
print(fibonacci(number=7)) #(1 + 1 + 2 + 3 + 5 + 8 + 13)
print(fibonacci(number=8)) #(1 + 1 + 2 + 3 + 5 + 8 + 13 + 21)
print(fibonacci(number=10))
#(1 + 1 + 2 + 3 + 5 + 8 + 13 + 21 + 34 + 55)
"""
Non RECURSION
"""
def fib_iter(number:int):
a,b = 0,1
for i in range(number):
a,b = b,a+b
return a
print(fib_iter(number=10)) #55
"""
RECURSION
"""
def fib_rec(n):
# base
if n <= 1:
return n
#recurse
else:
return fib_rec(n-1) + fib_rec(n-2)
print("fib_rec")
print(fib_rec(10)) #55
"""
Memoize RECURSION
"""
# Cache
n = 10
cache = [None] * (n+1)
def fib_dyn(n):
# Base Case
if n <= 1:
return n
# Check Cache
if cache[n] != None:
return cache[n]
# Keep Setting Cache
cache[n] = fib_dyn(n-1) + fib_dyn(n-2)
return cache[n]