{"id":4535,"date":"2015-09-05T05:16:31","date_gmt":"2015-09-05T05:16:31","guid":{"rendered":"http:\/\/a1webdesignteam.com\/blog\/?p=4535"},"modified":"2015-09-05T05:31:55","modified_gmt":"2015-09-05T05:31:55","slug":"fibonacci-series-in-java","status":"publish","type":"post","link":"https:\/\/a1webdesignteam.com\/blog\/fibonacci-series-in-java\/","title":{"rendered":"Fibonacci series in Java"},"content":{"rendered":"<p>In fibonacci series, <em>next number is the sum of previous two numbers<\/em> for example 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 etc. The first two numbers of fibonacci series are 0 and 1.<\/p>\n<p>There are two ways to write the fibonacci series program in java:<\/p>\n<ul class=\"points\">\n<li>Fibonacci Series without using recursion<\/li>\n<li>Fibonacci Series using recursion<\/li>\n<\/ul>\n<h2 class=\"h2\">Fibonacci Series in Java without using recursion<\/h2>\n<p>Let&#8217;s see the fibonacci series program in java without using recursion.<\/p>\n<div class=\"codeblock\">\n<div class=\"dp-highlighter\">\n<div class=\"bar\"><\/div>\n<ol class=\"dp-j\" start=\"1\">\n<li class=\"alt\"><span class=\"keyword\">class<\/span>\u00a0FibonacciExample1{<\/li>\n<li class=\"\"><span class=\"keyword\">public<\/span>\u00a0<span class=\"keyword\">static<\/span>\u00a0<span class=\"keyword\">void<\/span>\u00a0main(String\u00a0args[])<\/li>\n<li class=\"alt\">{<\/li>\n<li class=\"\">\u00a0<span class=\"keyword\">int<\/span>\u00a0n1=<span class=\"number\">0<\/span>,n2=<span class=\"number\">1<\/span>,n3,i,count=<span class=\"number\">10<\/span>;<\/li>\n<li class=\"alt\">\u00a0System.out.print(n1+<span class=\"string\">&#8221;\u00a0&#8220;<\/span>+n2);<span class=\"comment\">\/\/printing\u00a00\u00a0and\u00a01\u00a0\u00a0<\/span><\/li>\n<li class=\"\"><\/li>\n<li class=\"alt\">\u00a0<span class=\"keyword\">for<\/span>(i=<span class=\"number\">2<\/span>;i&lt;count;++i)<span class=\"comment\">\/\/loop\u00a0starts\u00a0from\u00a02\u00a0because\u00a00\u00a0and\u00a01\u00a0are\u00a0already\u00a0printed\u00a0\u00a0<\/span><\/li>\n<li class=\"\">\u00a0{<\/li>\n<li class=\"alt\">\u00a0\u00a0n3=n1+n2;<\/li>\n<li class=\"\">\u00a0\u00a0System.out.print(<span class=\"string\">&#8221;\u00a0&#8220;<\/span>+n3);<\/li>\n<li class=\"alt\">\u00a0\u00a0n1=n2;<\/li>\n<li class=\"\">\u00a0\u00a0n2=n3;<\/li>\n<li class=\"alt\">\u00a0}<\/li>\n<li class=\"\"><\/li>\n<li class=\"alt\">}}<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<p>Output:<\/p>\n<div class=\"codeblock3\">\n<pre>0 1 1 2 3 5 8 13 21 34\r\n<\/pre>\n<\/div>\n<h2 class=\"h2\">Fibonacci Series using recursion in java<\/h2>\n<p>Let&#8217;s see the fibonacci series program in java using recursion.<\/p>\n<div class=\"codeblock\">\n<div class=\"dp-highlighter\">\n<div class=\"bar\"><\/div>\n<ol class=\"dp-cpp\" start=\"1\">\n<li class=\"alt\"><span class=\"keyword\">class<\/span>\u00a0FibonacciExample2{<\/li>\n<li class=\"\">\u00a0<span class=\"keyword\">static<\/span>\u00a0<span class=\"datatypes\">int<\/span>\u00a0n1=0,n2=1,n3=0;<\/li>\n<li class=\"alt\">\u00a0<span class=\"keyword\">static<\/span>\u00a0<span class=\"keyword\">void<\/span>\u00a0printFibonacci(<span class=\"datatypes\">int<\/span>\u00a0count){<\/li>\n<li class=\"\">\u00a0\u00a0\u00a0\u00a0<span class=\"keyword\">if<\/span>(count&gt;0){<\/li>\n<li class=\"alt\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0n3\u00a0=\u00a0n1\u00a0+\u00a0n2;<\/li>\n<li class=\"\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0n1\u00a0=\u00a0n2;<\/li>\n<li class=\"alt\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0n2\u00a0=\u00a0n3;<\/li>\n<li class=\"\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0System.out.print(<span class=\"string\">&#8221;\u00a0&#8220;<\/span>+n3);<\/li>\n<li class=\"alt\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0printFibonacci(count-1);<\/li>\n<li class=\"\">\u00a0\u00a0\u00a0\u00a0\u00a0}<\/li>\n<li class=\"alt\">\u00a0}<\/li>\n<li class=\"\">\u00a0<span class=\"keyword\">public<\/span>\u00a0<span class=\"keyword\">static<\/span>\u00a0<span class=\"keyword\">void<\/span>\u00a0main(String\u00a0args[]){<\/li>\n<li class=\"alt\">\u00a0\u00a0<span class=\"datatypes\">int<\/span>\u00a0count=10;<\/li>\n<li class=\"\">\u00a0\u00a0System.out.print(n1+<span class=\"string\">&#8221;\u00a0&#8220;<\/span>+n2);<span class=\"comment\">\/\/printing\u00a00\u00a0and\u00a01\u00a0\u00a0<\/span><\/li>\n<li class=\"alt\">\u00a0\u00a0printFibonacci(count-2);<span class=\"comment\">\/\/n-2\u00a0because\u00a02\u00a0numbers\u00a0are\u00a0already\u00a0printed\u00a0<\/span><\/li>\n<li class=\"\">\u00a0}<\/li>\n<li class=\"alt\">}<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<p>Output:<\/p>\n<div class=\"codeblock3\">\n<pre>0 1 1 2 3 5 8 13 21 34\r\n<\/pre>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>In fibonacci series, next number is the sum of previous two numbers for example 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 etc. The first two numbers of fibonacci series are 0 and 1. There are two ways to write the fibonacci series program in java: Fibonacci Series without using recursion Fibonacci [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":4537,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0},"categories":[25],"tags":[51],"_links":{"self":[{"href":"https:\/\/a1webdesignteam.com\/blog\/wp-json\/wp\/v2\/posts\/4535"}],"collection":[{"href":"https:\/\/a1webdesignteam.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/a1webdesignteam.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/a1webdesignteam.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/a1webdesignteam.com\/blog\/wp-json\/wp\/v2\/comments?post=4535"}],"version-history":[{"count":0,"href":"https:\/\/a1webdesignteam.com\/blog\/wp-json\/wp\/v2\/posts\/4535\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/a1webdesignteam.com\/blog\/wp-json\/wp\/v2\/media\/4537"}],"wp:attachment":[{"href":"https:\/\/a1webdesignteam.com\/blog\/wp-json\/wp\/v2\/media?parent=4535"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/a1webdesignteam.com\/blog\/wp-json\/wp\/v2\/categories?post=4535"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/a1webdesignteam.com\/blog\/wp-json\/wp\/v2\/tags?post=4535"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}