{"id":2237,"date":"2018-06-04T09:12:00","date_gmt":"2018-06-04T09:12:00","guid":{"rendered":"https:\/\/www.testingdocs.com\/questions\/?p=2237"},"modified":"2024-08-09T09:01:48","modified_gmt":"2024-08-09T09:01:48","slug":"fibonacci-sequence-using-recursion-java-program","status":"publish","type":"post","link":"https:\/\/www.testingdocs.com\/questions\/fibonacci-sequence-using-recursion-java-program\/","title":{"rendered":"Fibonacci Sequence using Recursion Java Program"},"content":{"rendered":"<h2>Fibonacci Sequence using Recursion Java Program<\/h2>\r\n<p>In this post, we will a simple java program to print the Fibonacci sequence using recursion. The program prompts the user to enter the number of terms in the sequence to print.<\/p>\r\n<p>Recursive formula for the fibonacci sequence is:<\/p>\r\n<p>F(n) = F(n-1) + F(n-2)<\/p>\r\n<h3>Java Program<\/h3>\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">import java.util.Scanner;\r\n\r\npublic class FibonacciSequence {\r\n\r\n  public static void main(String[] args) {\r\n    Scanner keyboard=new Scanner(System.in);\r\n    System.out.print(\"Enter numbers of terms (n):= \");\r\n    int n = keyboard.nextInt();\r\n    \/\/Print the sequence\r\n    System.out.print(\"Fibonacci sequence upto n terms:= \");\r\n    for(int i=0;i&lt;n;i++) {\r\n      System.out.print(fibonacci(i)+ \" \");\/\/Invoking the recursive method\r\n    }\r\n  }\r\n\r\n  \/**************************************\r\n   * Recursive method fibonacci\r\n   * @param n\r\n   * @return\r\n   *\/\r\n  public static long fibonacci(long n) {\r\n    if(n==0)\r\n      return 0;\r\n    else if(n==1)\r\n      return 1;\r\n    else\r\n      return fibonacci(n-1) + fibonacci(n-2);\r\n  }\r\n}\r\n<\/pre>\r\n<p>&nbsp;<\/p>\r\n<h3>Output<\/h3>\r\n<p>Enter numbers of terms (n):= 10<br \/>Fibonacci sequence upto n terms:= 0 1 1 2 3 5 8 13 21 34<\/p>\r\n<h3>Screenshot<\/h3>\r\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-2239\" src=\"https:\/\/www.testingdocs.com\/questions\/wp-content\/uploads\/Fibonacci-Sequence-Java-Program.png\" alt=\"Fibonacci Sequence Java Program\" width=\"1727\" height=\"1023\" title=\"\" srcset=\"https:\/\/www.testingdocs.com\/questions\/wp-content\/uploads\/Fibonacci-Sequence-Java-Program.png 1727w, https:\/\/www.testingdocs.com\/questions\/wp-content\/uploads\/Fibonacci-Sequence-Java-Program-300x178.png 300w, https:\/\/www.testingdocs.com\/questions\/wp-content\/uploads\/Fibonacci-Sequence-Java-Program-1024x607.png 1024w, https:\/\/www.testingdocs.com\/questions\/wp-content\/uploads\/Fibonacci-Sequence-Java-Program-768x455.png 768w, https:\/\/www.testingdocs.com\/questions\/wp-content\/uploads\/Fibonacci-Sequence-Java-Program-1536x910.png 1536w\" sizes=\"auto, (max-width: 1727px) 100vw, 1727px\" \/><\/p>\r\n<p>&nbsp;<\/p>\r\n<p>&#8212;<\/p>\r\n<p>Java Tutorial on this website: <strong><a href=\"https:\/\/www.testingdocs.com\/java-tutorial\/\">https:\/\/www.testingdocs.com\/java-tutorial\/<\/a><\/strong><\/p>\r\n<p>For more information on Java, visit the official website :<\/p>\r\n<p><strong><a href=\"https:\/\/www.oracle.com\/in\/java\/\" rel=\"noopener\">https:\/\/www.oracle.com\/in\/java\/<\/a><\/strong><\/p>\r\n","protected":false},"excerpt":{"rendered":"<p>Fibonacci Sequence using Recursion Java Program In this post, we will a simple java program to print the Fibonacci sequence using recursion. The program prompts the user to enter the number of terms in the sequence to print. Recursive formula for the fibonacci sequence is: F(n) = F(n-1) + F(n-2) Java Program import java.util.Scanner; public [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[18],"tags":[],"class_list":["post-2237","post","type-post","status-publish","format-standard","hentry","category-java-programs","has-post-title","has-post-date","has-post-category","has-post-tag","has-post-comment","has-post-author",""],"_links":{"self":[{"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/posts\/2237","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/comments?post=2237"}],"version-history":[{"count":7,"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/posts\/2237\/revisions"}],"predecessor-version":[{"id":23834,"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/posts\/2237\/revisions\/23834"}],"wp:attachment":[{"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/media?parent=2237"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/categories?post=2237"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/tags?post=2237"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}