Skip to content

Commit d39d762

Browse files
committed
fixed shadow
1 parent 3e2c2d9 commit d39d762

File tree

2 files changed

+13
-14
lines changed

2 files changed

+13
-14
lines changed

pygorithm/fibonacci/memoization.py

Lines changed: 7 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,6 @@
22
Fibonacci implementation through cache.
33
"""
44
import inspect
5-
# TODO: Fix shadowed parameter names
65

76

87
def get_sequence(n):
@@ -11,20 +10,20 @@ def get_sequence(n):
1110
"""
1211
cache = {0: 0, 1: 1}
1312

14-
def fib(n):
13+
def fib(num):
1514
"""
1615
Return Fibonacci value by specified number as integer.
1716
"""
18-
if n in cache:
19-
return cache[n]
20-
cache[n] = fib(n - 1) + fib(n - 2)
21-
return cache[n]
17+
if num in cache:
18+
return cache[num]
19+
cache[num] = fib(num - 1) + fib(num - 2)
20+
return cache[num]
2221

23-
def sequence(n):
22+
def sequence(num):
2423
"""
2524
Return sequence of Fibonacci values as list.
2625
"""
27-
return [fib(value) for value in range(n + 1)]
26+
return [fib(value) for value in range(num + 1)]
2827

2928
return sequence(n)
3029

pygorithm/fibonacci/recursion.py

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -8,20 +8,20 @@ def get_sequence(n):
88
"""
99
Return Fibonacci sequence from zero to specified number as list.
1010
"""
11-
def fib(n):
11+
def fib(num):
1212
"""
1313
Return Fibonacci value by specified number as integer.
1414
"""
15-
if n <= 1:
16-
return n
15+
if num <= 1:
16+
return num
1717

18-
return fib(n - 1) + fib(n - 2)
18+
return fib(num - 1) + fib(num - 2)
1919

20-
def sequence(n):
20+
def sequence(num):
2121
"""
2222
Return sequence of Fibonacci values as list.
2323
"""
24-
return [fib(value) for value in range(n + 1)]
24+
return [fib(value) for value in range(num + 1)]
2525

2626
return sequence(n)
2727

0 commit comments

Comments
 (0)