{"id":483,"date":"2025-08-22T12:31:56","date_gmt":"2025-08-22T12:31:56","guid":{"rendered":"https:\/\/hmoweb.net\/Python\/?p=483"},"modified":"2025-08-30T17:37:46","modified_gmt":"2025-08-30T17:37:46","slug":"ejercicio-13-recusion","status":"publish","type":"post","link":"https:\/\/hmoweb.net\/Python\/2025\/08\/22\/ejercicio-13-recusion\/","title":{"rendered":"Ejercicio 13 Recusi\u00f3n"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\">Es recomendable que este ejercicio lo escribas por partes y lo revises, para ver que se obtiene el resultado esperado. Este ejercicio lo podr\u00e1s seguir en el video <a href=\"https:\/\/youtu.be\/DLikpfc64cA?si=0L72-SeJgpO8UH4l&amp;t=12589s\" target=\"_blank\" rel=\"noreferrer noopener\">Aprender Pytho<\/a>n en el minuto [3:29:49].<\/p>\n\n\n\n<a href=\"https:\/\/youtu.be\/DLikpfc64cA?si=7NvurLMnWqAcr0KJ&#038;t=12589s\" target=\"_blank\">\n  Ver video desde el minuto 3:29:49\n<\/a>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: python; title: ; notranslate\" title=\"\">\n&quot;&quot;&quot;\nEjercicio # 13 Recursi\u00f3n\n22\/08\/2025\nEdito AHR\n&quot;&quot;&quot;\n\nprint(&quot;\\nActividad 1&quot;)\nprint(&quot;Funcion de Fibonacci() primera posicion 0&quot;)\nprint(&quot;0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 ....&quot;)\ndef fibonacci(n):\n    if n == 0 or n == 1:    # Caso base con STOP\n        return n\n    else:\n        return fibonacci(n-1) + fibonacci(n-2)   # Funcin Recursiva\nprint(fibonacci(2))\nprint(fibonacci(3))\nprint(fibonacci(8))\n\nprint(&quot;----Fibonacci1 primera posicion 1---&quot;)\ndef fibonacci1(n):\n    if n &lt;= 0:\n        return &quot;El numero debe ser mayor que 0&quot;\n    elif n == 1:\n        return 0\n    elif n == 2:\n        return 1\n    else:\n        return fibonacci1(n-1) + fibonacci1(n-2)\nprint(fibonacci1(2))\nprint(fibonacci1(3))\nprint(fibonacci1(8))\n\nprint(&quot;\\nActividad 2&quot;)\nprint(&quot;factorial&quot;)\ndef factorial(n):\n    if n == 0 or n == 1:\n        return 1\n    else:\n        return n * factorial(n-1)\nprint(factorial(5))\n\n<\/pre><\/div>\n\n\n<p class=\"wp-block-paragraph\">A continuaci\u00f3n, corre el programa desde el men\u00fa Run\/Run Module (o bien con la tecla &#8216;F5&#8217;), te muestro el resultado en la consola (Shell):<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>= RESTART: C:\/Users\/Codigo\/Ejercicio 13 Recursion.py\n\nActividad 1\nFuncion de Fibonacci() primera posicion 0\n0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 ....\n1\n2\n21\n----Fibonacci1 primera posicion 1---\n1\n1\n13\n\nActividad 2\nfactorial\n120<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Es recomendable que este ejercicio lo escribas por partes y lo revises, para ver que se obtiene el resultado esperado. Este ejercicio lo podr\u00e1s seguir en el video Aprender Python en el minuto [3:29:49]. Ver video desde el minuto 3:29:49 A continuaci\u00f3n, corre el programa desde el men\u00fa Run\/Run Module (o bien con la tecla &#8230; <a title=\"Ejercicio 13 Recusi\u00f3n\" class=\"read-more\" href=\"https:\/\/hmoweb.net\/Python\/2025\/08\/22\/ejercicio-13-recusion\/\" aria-label=\"Leer m\u00e1s sobre Ejercicio 13 Recusi\u00f3n\">Leer m\u00e1s<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"pagelayer_contact_templates":[],"_pagelayer_content":"","_themeisle_gutenberg_block_has_review":false,"footnotes":""},"categories":[1],"tags":[],"class_list":["post-483","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/hmoweb.net\/Python\/wp-json\/wp\/v2\/posts\/483","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hmoweb.net\/Python\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hmoweb.net\/Python\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hmoweb.net\/Python\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/hmoweb.net\/Python\/wp-json\/wp\/v2\/comments?post=483"}],"version-history":[{"count":5,"href":"https:\/\/hmoweb.net\/Python\/wp-json\/wp\/v2\/posts\/483\/revisions"}],"predecessor-version":[{"id":671,"href":"https:\/\/hmoweb.net\/Python\/wp-json\/wp\/v2\/posts\/483\/revisions\/671"}],"wp:attachment":[{"href":"https:\/\/hmoweb.net\/Python\/wp-json\/wp\/v2\/media?parent=483"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hmoweb.net\/Python\/wp-json\/wp\/v2\/categories?post=483"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hmoweb.net\/Python\/wp-json\/wp\/v2\/tags?post=483"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}