{"id":5725,"date":"2021-05-13T13:16:56","date_gmt":"2021-05-13T07:46:56","guid":{"rendered":"https:\/\/python-programs.com\/?p=5725"},"modified":"2021-11-22T18:45:27","modified_gmt":"2021-11-22T13:15:27","slug":"designing-code-for-fibonacci-sequence-without-recursion","status":"publish","type":"post","link":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/","title":{"rendered":"Designing Code for Fibonacci Sequence without Recursion"},"content":{"rendered":"<p><strong>Fibonacci sequence:<\/strong><\/p>\n<p>The Fibonacci sequence is a sequence type in which the sum of the previous two numbers is each consecutive number.<\/p>\n<p>First few Fibonacci numbers are 0 1 1 2 3 5 8 &#8230;..etc.<\/p>\n<h2>Fibonacci sequence without recursion:<\/h2>\n<p>Let us now write code to display this sequence without recursion. Because recursion is simple, i.e. just use the concept,<\/p>\n<p>Fib(i) = Fib(i-1) + Fib(i-2)<\/p>\n<p>However, because of the repeated calculations in recursion, large numbers take a long time.<\/p>\n<p>So, without recursion, let&#8217;s do it.<\/p>\n<p><strong>Approach:<\/strong><\/p>\n<ul>\n<li>Create two variables to hold the values of the previous and second previous numbers.<\/li>\n<li>Set both variables to 0 to begin.<\/li>\n<li>Begin a loop until N is reached, and for each i-th index\n<ul>\n<li>Print the sum of the previous and second most previous i.e sum= previous + second previous<\/li>\n<li>Assign previous to second previous i.e. second previous= previous<\/li>\n<li>Assign sum to previous i.e previous=sum<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p><strong>Below is the implementation:<\/strong><\/p>\n<p><strong>1)C++ implementation of above approach.<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\">#include &lt;iostream&gt;\r\nusing namespace std;\r\nint main()\r\n{ \/\/ given number\r\n    int n = 10;\r\n    \/\/ initializing previous and second previous to 0\r\n    int previous = 0;\r\n    int secondprevious = 0;\r\n    int i;\r\n    \/\/ loop till n\r\n    for (i = 0; i &lt; n; i++) {\r\n        \/\/ initializing sum to previous + second previous\r\n        int sum = previous + secondprevious;\r\n        cout &lt;&lt; sum &lt;&lt; \" \";\r\n        if (!sum)\r\n            previous = 1;\r\n        secondprevious = previous;\r\n        previous = sum;\r\n    }\r\n    return 0;\r\n}\r\n<\/pre>\n<p><strong>2)Python implementation of above approach.<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\"># given number\r\nn = 10\r\n# initializing previous and second previous to 0\r\nprevious = 0\r\nsecondprevious = 0\r\n# loop till n\r\nfor i in range(n):\r\n    sum = previous + secondprevious\r\n    print(sum, end=\" \")\r\n    if (not sum):\r\n        previous = 1\r\n    # initializing value to previous to second previous\r\n    secondprevious = previous\r\n    previous = sum\r\n<\/pre>\n<p><strong>Output:<\/strong><\/p>\n<pre id=\"codeOutputPre\">0 1 1 2 3 5 8 13 21 34<\/pre>\n<p><strong>Related Programs<\/strong>:<\/p>\n<ul>\n<li><a href=\"https:\/\/python-programs.com\/object-oriented-approach-to-display-a-sequence-of-numbers-without-any-for-loop-or-recursion-in-cpp\/\">object oriented approach to display a sequence of numbers without any for loop or recursion in cpp<\/a><\/li>\n<li><a href=\"https:\/\/python-programs.com\/python-program-to-print-numbers-in-a-range-1upper-without-using-any-loops-or-by-using-recursion\/\">python program to print numbers in a range 1upper without using any loops or by using recursion<\/a><\/li>\n<li><a href=\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/\">python program to print all permutations of a string in lexicographic order without recursion<\/a><\/li>\n<li><a href=\"https:\/\/python-programs.com\/python-program-to-find-the-fibonacci-series-using-recursion\/\">python program to find the fibonacci series using recursion<\/a><\/li>\n<li><a href=\"https:\/\/python-programs.com\/software-engineering-notes-for-mca\/\">software engineering notes for mca<\/a><\/li>\n<li><a href=\"https:\/\/python-programs.com\/accounting-and-finance-for-bankers-notes\/\">accounting and finance for bankers notes<\/a><\/li>\n<li><a href=\"https:\/\/python-programs.com\/big-data-notes-for-cse\/\">big data notes for cse<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Fibonacci sequence: The Fibonacci sequence is a sequence type in which the sum of the previous two numbers is each consecutive number. First few Fibonacci numbers are 0 1 1 2 3 5 8 &#8230;..etc. Fibonacci sequence without recursion: Let us now write code to display this sequence without recursion. Because recursion is simple, i.e. &hellip;<\/p>\n<p class=\"read-more\"> <a class=\"\" href=\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/\"> <span class=\"screen-reader-text\">Designing Code for Fibonacci Sequence without Recursion<\/span> Read More &raquo;<\/a><\/p>\n","protected":false},"author":7,"featured_media":5729,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"spay_email":"","jetpack_publicize_message":"","jetpack_is_tweetstorm":false,"jetpack_publicize_feature_enabled":true},"categories":[19,5],"tags":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v18.9 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Designing Code for Fibonacci Sequence without Recursion - Python Programs<\/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:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Designing Code for Fibonacci Sequence without Recursion - Python Programs\" \/>\n<meta property=\"og:description\" content=\"Fibonacci sequence: The Fibonacci sequence is a sequence type in which the sum of the previous two numbers is each consecutive number. First few Fibonacci numbers are 0 1 1 2 3 5 8 &#8230;..etc. Fibonacci sequence without recursion: Let us now write code to display this sequence without recursion. Because recursion is simple, i.e. &hellip; Designing Code for Fibonacci Sequence without Recursion Read More &raquo;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/\" \/>\n<meta property=\"og:site_name\" content=\"Python Programs\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/btechgeeks\" \/>\n<meta property=\"article:published_time\" content=\"2021-05-13T07:46:56+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2021-11-22T13:15:27+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/05\/Designing-Code-for-Fibonacci-Sequence-without-Recursion.png\" \/>\n\t<meta property=\"og:image:width\" content=\"1280\" \/>\n\t<meta property=\"og:image:height\" content=\"720\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@btech_geeks\" \/>\n<meta name=\"twitter:site\" content=\"@btech_geeks\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Vikram Chiluka\" \/>\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\":\"Organization\",\"@id\":\"https:\/\/python-programs.com\/#organization\",\"name\":\"BTech Geeks\",\"url\":\"https:\/\/python-programs.com\/\",\"sameAs\":[\"https:\/\/www.instagram.com\/btechgeeks\/\",\"https:\/\/www.linkedin.com\/in\/btechgeeks\",\"https:\/\/in.pinterest.com\/btechgeek\/\",\"https:\/\/www.youtube.com\/channel\/UC9MlCqdJ3lKqz2p5114SDIg\",\"https:\/\/www.facebook.com\/btechgeeks\",\"https:\/\/twitter.com\/btech_geeks\"],\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/python-programs.com\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/python-programs.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png\",\"contentUrl\":\"https:\/\/python-programs.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png\",\"width\":350,\"height\":70,\"caption\":\"BTech Geeks\"},\"image\":{\"@id\":\"https:\/\/python-programs.com\/#\/schema\/logo\/image\/\"}},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/python-programs.com\/#website\",\"url\":\"https:\/\/python-programs.com\/\",\"name\":\"Python Programs\",\"description\":\"Python Programs with Examples, How To Guides on Python\",\"publisher\":{\"@id\":\"https:\/\/python-programs.com\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/python-programs.com\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#primaryimage\",\"url\":\"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/05\/Designing-Code-for-Fibonacci-Sequence-without-Recursion.png\",\"contentUrl\":\"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/05\/Designing-Code-for-Fibonacci-Sequence-without-Recursion.png\",\"width\":1280,\"height\":720,\"caption\":\"Designing Code for Fibonacci Sequence without Recursion\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#webpage\",\"url\":\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/\",\"name\":\"Designing Code for Fibonacci Sequence without Recursion - Python Programs\",\"isPartOf\":{\"@id\":\"https:\/\/python-programs.com\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#primaryimage\"},\"datePublished\":\"2021-05-13T07:46:56+00:00\",\"dateModified\":\"2021-11-22T13:15:27+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/python-programs.com\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Designing Code for Fibonacci Sequence without Recursion\"}]},{\"@type\":\"Article\",\"@id\":\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#webpage\"},\"author\":{\"@id\":\"https:\/\/python-programs.com\/#\/schema\/person\/fb109fd98e2d5a15fd4dac9970797602\"},\"headline\":\"Designing Code for Fibonacci Sequence without Recursion\",\"datePublished\":\"2021-05-13T07:46:56+00:00\",\"dateModified\":\"2021-11-22T13:15:27+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#webpage\"},\"wordCount\":243,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/python-programs.com\/#organization\"},\"image\":{\"@id\":\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/05\/Designing-Code-for-Fibonacci-Sequence-without-Recursion.png\",\"articleSection\":[\"CPP Programming\",\"Python\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#respond\"]}]},{\"@type\":\"Person\",\"@id\":\"https:\/\/python-programs.com\/#\/schema\/person\/fb109fd98e2d5a15fd4dac9970797602\",\"name\":\"Vikram Chiluka\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/python-programs.com\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/c56c77f578d45de43af6feb443618ed7?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/c56c77f578d45de43af6feb443618ed7?s=96&d=mm&r=g\",\"caption\":\"Vikram Chiluka\"},\"url\":\"https:\/\/python-programs.com\/author\/vikram\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Designing Code for Fibonacci Sequence without Recursion - Python Programs","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:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/","og_locale":"en_US","og_type":"article","og_title":"Designing Code for Fibonacci Sequence without Recursion - Python Programs","og_description":"Fibonacci sequence: The Fibonacci sequence is a sequence type in which the sum of the previous two numbers is each consecutive number. First few Fibonacci numbers are 0 1 1 2 3 5 8 &#8230;..etc. Fibonacci sequence without recursion: Let us now write code to display this sequence without recursion. Because recursion is simple, i.e. &hellip; Designing Code for Fibonacci Sequence without Recursion Read More &raquo;","og_url":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/","og_site_name":"Python Programs","article_publisher":"https:\/\/www.facebook.com\/btechgeeks","article_published_time":"2021-05-13T07:46:56+00:00","article_modified_time":"2021-11-22T13:15:27+00:00","og_image":[{"width":1280,"height":720,"url":"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/05\/Designing-Code-for-Fibonacci-Sequence-without-Recursion.png","type":"image\/png"}],"twitter_card":"summary_large_image","twitter_creator":"@btech_geeks","twitter_site":"@btech_geeks","twitter_misc":{"Written by":"Vikram Chiluka","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Organization","@id":"https:\/\/python-programs.com\/#organization","name":"BTech Geeks","url":"https:\/\/python-programs.com\/","sameAs":["https:\/\/www.instagram.com\/btechgeeks\/","https:\/\/www.linkedin.com\/in\/btechgeeks","https:\/\/in.pinterest.com\/btechgeek\/","https:\/\/www.youtube.com\/channel\/UC9MlCqdJ3lKqz2p5114SDIg","https:\/\/www.facebook.com\/btechgeeks","https:\/\/twitter.com\/btech_geeks"],"logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/python-programs.com\/#\/schema\/logo\/image\/","url":"https:\/\/python-programs.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png","contentUrl":"https:\/\/python-programs.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png","width":350,"height":70,"caption":"BTech Geeks"},"image":{"@id":"https:\/\/python-programs.com\/#\/schema\/logo\/image\/"}},{"@type":"WebSite","@id":"https:\/\/python-programs.com\/#website","url":"https:\/\/python-programs.com\/","name":"Python Programs","description":"Python Programs with Examples, How To Guides on Python","publisher":{"@id":"https:\/\/python-programs.com\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/python-programs.com\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#primaryimage","url":"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/05\/Designing-Code-for-Fibonacci-Sequence-without-Recursion.png","contentUrl":"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/05\/Designing-Code-for-Fibonacci-Sequence-without-Recursion.png","width":1280,"height":720,"caption":"Designing Code for Fibonacci Sequence without Recursion"},{"@type":"WebPage","@id":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#webpage","url":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/","name":"Designing Code for Fibonacci Sequence without Recursion - Python Programs","isPartOf":{"@id":"https:\/\/python-programs.com\/#website"},"primaryImageOfPage":{"@id":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#primaryimage"},"datePublished":"2021-05-13T07:46:56+00:00","dateModified":"2021-11-22T13:15:27+00:00","breadcrumb":{"@id":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/python-programs.com\/"},{"@type":"ListItem","position":2,"name":"Designing Code for Fibonacci Sequence without Recursion"}]},{"@type":"Article","@id":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#article","isPartOf":{"@id":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#webpage"},"author":{"@id":"https:\/\/python-programs.com\/#\/schema\/person\/fb109fd98e2d5a15fd4dac9970797602"},"headline":"Designing Code for Fibonacci Sequence without Recursion","datePublished":"2021-05-13T07:46:56+00:00","dateModified":"2021-11-22T13:15:27+00:00","mainEntityOfPage":{"@id":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#webpage"},"wordCount":243,"commentCount":0,"publisher":{"@id":"https:\/\/python-programs.com\/#organization"},"image":{"@id":"https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#primaryimage"},"thumbnailUrl":"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/05\/Designing-Code-for-Fibonacci-Sequence-without-Recursion.png","articleSection":["CPP Programming","Python"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/python-programs.com\/designing-code-for-fibonacci-sequence-without-recursion\/#respond"]}]},{"@type":"Person","@id":"https:\/\/python-programs.com\/#\/schema\/person\/fb109fd98e2d5a15fd4dac9970797602","name":"Vikram Chiluka","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/python-programs.com\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/c56c77f578d45de43af6feb443618ed7?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/c56c77f578d45de43af6feb443618ed7?s=96&d=mm&r=g","caption":"Vikram Chiluka"},"url":"https:\/\/python-programs.com\/author\/vikram\/"}]}},"jetpack_featured_media_url":"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/05\/Designing-Code-for-Fibonacci-Sequence-without-Recursion.png","_links":{"self":[{"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts\/5725"}],"collection":[{"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/comments?post=5725"}],"version-history":[{"count":8,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts\/5725\/revisions"}],"predecessor-version":[{"id":11958,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts\/5725\/revisions\/11958"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/media\/5729"}],"wp:attachment":[{"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/media?parent=5725"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/categories?post=5725"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/tags?post=5725"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}