Fix Fibonacci in Python

Author: kelvins

src/python/fibonacci_iterativa.py renamed to src/python/fibonacci_iterative.py

@@ -9,7 +9,7 @@
 import time
 
 
-def fib_iterativa(number):
+def fibonacci(number):
     """Fibonacci iterativa."""
     last = 0
     curr = 1
@@ -18,7 +18,7 @@ def fib_iterativa(number):
     return last
 
 
-def run_fibonacci(name, func, number=35):
+def main(name, func, number=35):
     """
     Roda o algoritmo e mostra o tempo de execução dele
     """
@@ -29,4 +29,4 @@ def run_fibonacci(name, func, number=35):
 
 
 if __name__ == "__main__":
-    run_fibonacci("Iterativa", fib_iterativa)
+    main("Iterativa", fibonacci)

src/python/fibonacci_memoization.py

@@ -1,16 +1,24 @@
-def fibonacci(n, memo={}):
-    if n <= 1:
-        return 1
+import functools
+import time
 
-    # Check if the result is already memoized
-    if n in memo:
-        return memo[n]
 
-    # Calculate Fibonacci recursively and store the result in memoization
-    result = fibonacci(n - 1, memo) + fibonacci(n - 2, memo)
-    memo[n] = result
+@functools.lru_cache(maxsize=None)
+def fibonacci(number):
+    """Fibonacci recursiva com cache."""
+    if number < 2:
+        return number
+    return fibonacci(number - 1) + fibonacci(number - 2)
 
-    return result
 
-n = 16
-print(f"Fib({n}): {fibonacci(n)}")
+def main(name, func, number=35):
+    """
+    Roda o algoritmo e mostra o tempo de execução dele
+    """
+    start_time = time.time()
+    result = func(number)
+    diff_time = time.time() - start_time
+    print("Fibonacci", name, ":", result, ":", "%.8f" % diff_time, "segundos")
+
+
+if __name__ == "__main__":
+    main("Fibonacci Memoization:", fibonacci)

src/python/fibonacci_recursiva.py

@@ -5,25 +5,16 @@
 execução dos algoritmos em segundos
 """
 
-import functools
 import time
 
-def fib_recursiva(number):
+def fibonacci(number):
     """Fibonnaci recursiva."""
     if number < 2:
         return number
-    return fib_recursiva(number - 1) + fib_recursiva(number - 2)
+    return fibonacci(number - 1) + fibonacci(number - 2)
 
 
-@functools.lru_cache(maxsize=None)
-def fib_recursiva_com_cache(number):
-    """Fibonacci recursiva com cache."""
-    if number < 2:
-        return number
-    return fib_recursiva_com_cache(number - 1) + fib_recursiva_com_cache(number - 2)
-
-
-def run_fibonacci(name, func, number=35):
+def main(name, func, number=35):
     """
     Roda o algoritmo e mostra o tempo de execução dele
     """
@@ -34,5 +25,4 @@ def run_fibonacci(name, func, number=35):
 
 
 if __name__ == "__main__":
-    run_fibonacci("Recursiva", fib_recursiva)
-    run_fibonacci("Recursiva com Cache", fib_recursiva_com_cache)
+    main("Recursiva", fibonacci)