{"id":5148,"date":"2022-08-26T23:32:27","date_gmt":"2022-08-26T18:02:27","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/"},"modified":"2022-08-26T23:32:27","modified_gmt":"2022-08-26T18:02:27","slug":"solved-recursive-implementation-of-fibonacci-function","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/","title":{"rendered":"[Solved] Recursive implementation of Fibonacci function"},"content":{"rendered":"<p> [ad_1]<br \/>\n<\/p>\n<div id=\"answer-53206873\" class=\"answer js-answer accepted-answer js-accepted-answer\" data-answerid=\"53206873\" data-parentid=\"53206676\" data-score=\"3\" data-position-on-page=\"1\" data-highest-scored=\"1\" data-question-has-accepted-highest-score=\"1\" itemprop=\"acceptedAnswer\" itemscope itemtype=\"https:\/\/schema.org\/Answer\">\n<div class=\"post-layout\">\n<div class=\"votecell post-layout--left\"><\/div>\n<div class=\"answercell post-layout--right\">\n<div class=\"s-prose js-post-body\" itemprop=\"text\">\n<p>I pasted your code on <a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/tio.run\/#c-gcc\">https:\/\/tio.run\/#c-gcc<\/a>, and here&#8217;s the result:<\/p>\n<h3><code>main<\/code> prototype<\/h3>\n<pre><code>.code.tio.c:3:7: warning: \u2018main\u2019 takes only zero or two arguments [-Wmain]\n   int main(int fib) {\n       ^~~~\n<\/code><\/pre>\n<p>the <code>main<\/code> function prototype is <code>int main(void)<\/code> or <code>int main(int argc, char *argv[])<\/code><\/p>\n<p>Since you want user to input a number, you can choose the first form.<\/p>\n<h3><code>count<\/code> type<\/h3>\n<pre><code>.code.tio.c: In function \u2018main\u2019:\n.code.tio.c:7:5: error: \u2018count\u2019 undeclared (first use in this function)\n     count = 0;  \/\/ counts the number of times the function is called\n     ^~~~~\n<\/code><\/pre>\n<p>You must give a type to <code>count<\/code> variable, like<\/p>\n<pre><code>int count = 0;\n<\/code><\/pre>\n<h3><code>fib_rec<\/code> declaration<\/h3>\n<pre><code>.code.tio.c:8:12: warning: implicit declaration of function \u2018fib_rec\u2019 [-Wimplicit-function-declaration]\n     return fib_rec(n, &amp;count);\n            ^~~~~~~\n<\/code><\/pre>\n<p>You have not declared the function before using it.<\/p>\n<p>You can declare it this way: <code>int fib_rec(int n, int *count)<\/code> for instance before the <code>main<\/code> definition.<\/p>\n<h3><code>printf<\/code> usage<\/h3>\n<pre><code>.code.tio.c: In function \u2018fib_rec\u2019:\n.code.tio.c:21:15: warning: passing argument 1 of \u2018printf\u2019 from incompatible pointer type [-Wincompatible-pointer-types]\n       printf (count);\n               ^~~~~\n<\/code><\/pre>\n<p>The <code>printf<\/code> function ask for some formatting. If you want to display a integer value, use <code>%d<\/code>:<\/p>\n<pre><code>printf(\"count value is: %d\\n\", count);\n<\/code><\/pre>\n<h3>incompatible pointer type<\/h3>\n<pre><code>.code.tio.c:22:27: warning: passing argument 2 of \u2018fib_rec\u2019 makes pointer from integer without a cast [-Wint-conversion]\n       return fib_rec(n-1, *count)+ fib_rec(n-2, *count);\n                           ^~~~~~\n<\/code><\/pre>\n<p>Here <code>count<\/code> is already a pointer on integer, <code>*<\/code> is unnecessary:<\/p>\n<pre><code>return fib_rec(n-1, count)+ fib_rec(n-2, count);\n<\/code><\/pre>\n<h3>display of computed value<\/h3>\n<p>Your code return the computed value, but doesn&#8217;t display it.<br \/>\nTo do so, replace <code>return fib_rec(n, &amp;count);<\/code> with <\/p>\n<pre><code>printf(\"fib_rec(%d) = %d\\n\", n, fib_rec(n, &amp;count));\nreturn 0;\n<\/code><\/pre>\n<hr>\n<p>So the corrected code could be:<\/p>\n<pre><code>#include &lt;stdio.h&gt;\n\nint fib_rec(int n, int *count);\n\nint main(void) {\n    int n;\n    printf(\"enter n\\n\");\n    scanf(\"%d\",&amp;n);\n    int count = 0;  \/\/ counts the number of times the function is called\n    printf(\"fib_rec(%d) = %d\\n\", n, fib_rec(n, &amp;count));\n    return 0;\n\n}\n\nint fib_rec(int n, int *count)\n{\n    int b=0,c=1;\n    *count = *count +1;\n    if(n&lt;=1)\n    { \n       return n;\n    }\n    else\n    {\n      printf (\"count: %d\\n\", *count);\n      return fib_rec(n-1, count)+ fib_rec(n-2, count);\n    }\n}\n<\/code><\/pre>\n<\/p><\/div>\n<div class=\"mt24\"><\/div>\n<\/div>\n<p>            <span class=\"d-none\" itemprop=\"commentCount\">0<\/span> <\/p><\/div>\n<\/div>\n<p>[ad_2]<\/p>\n<p>solved Recursive implementation of Fibonacci function <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ad_1] I pasted your code on https:\/\/tio.run\/#c-gcc, and here&#8217;s the result: main prototype .code.tio.c:3:7: warning: \u2018main\u2019 takes only zero or two arguments [-Wmain] int main(int fib) { ^~~~ the main function prototype is int main(void) or int main(int argc, char *argv[]) Since you want user to input a number, you can choose the first form. &#8230; <a title=\"[Solved] Recursive implementation of Fibonacci function\" class=\"read-more\" href=\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/\" aria-label=\"More on [Solved] Recursive implementation of Fibonacci function\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[324,943,494],"class_list":["post-5148","post","type-post","status-publish","format-standard","hentry","category-solved","tag-c","tag-compiler-errors","tag-recursion"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.5 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>[Solved] Recursive implementation of Fibonacci function - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Recursive implementation of Fibonacci function - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] I pasted your code on https:\/\/tio.run\/#c-gcc, and here&#8217;s the result: main prototype .code.tio.c:3:7: warning: \u2018main\u2019 takes only zero or two arguments [-Wmain] int main(int fib) { ^~~~ the main function prototype is int main(void) or int main(int argc, char *argv[]) Since you want user to input a number, you can choose the first form. ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2022-08-26T18:02:27+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Recursive implementation of Fibonacci function\",\"datePublished\":\"2022-08-26T18:02:27+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/\"},\"wordCount\":132,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"c++\",\"compiler-errors\",\"recursion\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/\",\"name\":\"[Solved] Recursive implementation of Fibonacci function - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2022-08-26T18:02:27+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Recursive implementation of Fibonacci function\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Recursive implementation of Fibonacci function - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Recursive implementation of Fibonacci function - JassWeb","og_description":"[ad_1] I pasted your code on https:\/\/tio.run\/#c-gcc, and here&#8217;s the result: main prototype .code.tio.c:3:7: warning: \u2018main\u2019 takes only zero or two arguments [-Wmain] int main(int fib) { ^~~~ the main function prototype is int main(void) or int main(int argc, char *argv[]) Since you want user to input a number, you can choose the first form. ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/","og_site_name":"JassWeb","article_published_time":"2022-08-26T18:02:27+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Recursive implementation of Fibonacci function","datePublished":"2022-08-26T18:02:27+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/"},"wordCount":132,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["c++","compiler-errors","recursion"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/","url":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/","name":"[Solved] Recursive implementation of Fibonacci function - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2022-08-26T18:02:27+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-recursive-implementation-of-fibonacci-function\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Recursive implementation of Fibonacci function"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/5148","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=5148"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/5148\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=5148"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=5148"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=5148"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}