Complejidad Algoritmica

Author: UltiRequiem

Desarrollo/17_ComplejidadAlgoritmica.py

@@ -0,0 +1,33 @@
+import time
+import sys
+
+def factorial(n):
+    response = 1
+
+    while n > 1:
+        response = response * n
+        n = n - 1
+
+    return response
+
+
+def factorial_recursive(n):
+    if n == 1:
+        return 1
+
+    return n * factorial_recursive(n - 1)
+
+
+if __name__ == '__main__':
+    n = 2500
+    sys.setrecursionlimit(n + 10)
+
+    startingTime = time.time()
+    factorial(n)
+    endTime = time.time()
+    print(f"Execturion time with bucle\t{endTime - startingTime}");
+
+    startingTime = time.time()
+    factorial_recursive(n)
+    endTime = time.time()
+    print(f"Execution time with recusive\t{endTime - startingTime}");

Desarrollo/18_GraficadoSimple.py

@@ -0,0 +1,16 @@
+from bokeh.plotting import figure, output_file, show
+
+if __name__ == '__main__':
+    output_file('graficado_simple.html')
+    fig = figure()
+
+    total_vals = int(input('Cuantos valores quieres graficar?'))
+    x_vals = list(range(total_vals))
+    y_vals = []
+
+    for x in x_vals:
+        val = int(input(f'Valor y para {x}'))
+        y_vals.append(val)
+
+    fig.line(x_vals, y_vals, line_width=2)
+    show(fig)