{"id":2855,"date":"2014-03-03T13:05:46","date_gmt":"2014-03-03T18:05:46","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2855"},"modified":"2026-04-05T07:06:29","modified_gmt":"2026-04-05T12:06:29","slug":"2eva2003ti_t2-funcion-recursiva-fn","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva10\/2eva2003ti_t2-funcion-recursiva-fn\/","title":{"rendered":"2Eva2003TI_T2 Funci\u00f3n recursiva f(n)"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"2EvaIT2003\">Final I T\u00e9rmino 2003 \u2013 2004. Septiembre 02, 2003 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 2.<\/strong> (25 puntos) Escriba una <i>funci\u00f3n<\/i> recursiva <strong>f<\/strong> en C\/C++ tal que:<\/p>\n\n\n\n<span class=\"wp-katex-eq katex-display\" data-display=\"true\"> F(n) = \\begin{cases} \\frac{1}{2}, &amp;&amp; n=0,n=1 \\\\ \\frac{1}{2}[F(n-1)+F(n-2)],&amp;&amp; n&gt;1 \\text{, n es impar}\\\\ \\frac{1}{2}[F(n-1)-F(n-2)], &amp;&amp; n&gt;1 \\text{, n es impar} \\end{cases}<\/span>\n\n\n\n<p>Escriba un <i>programa<\/i> en C\/C++ que determine el mayor valor de la funci\u00f3n <strong>f<\/strong> para <strong>n<\/strong>=0, 1, 2, 3, 4, 5<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Final I T\u00e9rmino 2003 \u2013 2004. Septiembre 02, 2003 \/ICM00794 Tema 2. (25 puntos) Escriba una funci\u00f3n recursiva f en C\/C++ tal que: Escriba un programa en C\/C++ que determine el mayor valor de la funci\u00f3n f para n=0, 1, 2, 3, 4, 5<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"wp-custom-template-entrada-fp-ejercicios","format":"standard","meta":{"footnotes":""},"categories":[93],"tags":[156],"class_list":["post-2855","post","type-post","status-publish","format-standard","hentry","category-fp-2eva10","tag-funciones-recursivas"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2855","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/users\/8043"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/comments?post=2855"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2855\/revisions"}],"predecessor-version":[{"id":16717,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2855\/revisions\/16717"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2855"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2855"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2855"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}