We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent fab9fd9 commit 3bff040Copy full SHA for 3bff040
Roadmap/06 - RECURSIVIDAD/python/idiegorojas.py
@@ -0,0 +1,31 @@
1
+# Ejercicio
2
+
3
+def contar_atras(n):
4
+ if n < 0:
5
+ return
6
+ print(n)
7
+ contar_atras(n-1)
8
9
+print(contar_atras(100))
10
11
+# Calcular el factorial de un número
12
+def factorial(n):
13
+ if n == 0 or n == 1:
14
+ return 1
15
+ else:
16
+ return n * factorial(n - 1)
17
18
+print(factorial(5))
19
20
21
+# Fibonacci
22
+def fibonacci(posicion):
23
+ if posicion == 0:
24
+ return 0
25
+ elif posicion == 1:
26
27
28
+ return fibonacci(posicion - 1) + fibonacci(posicion - 2)
29
30
+posicion = 10
31
+print(f"El valor en la posición {posicion} de la sucesión de Fibonacci es: {fibonacci(posicion)}")
0 commit comments