A base case should be stated.<\/p>\n
Sum(1) = 1<\/strong><\/p>\n While coding recursive method we need to make sure that we end it successfully. The argument passed to the recursive method should converge to the base case. Each call will invoke a reduced problem so that it will reduce to the base case.<\/p>\n Sum(n) = n + Sum(n-1)<\/strong><\/p>\n <\/p>\n Once the control is passed from main() to the infinity(), it will never return to the main(). infinity() method calls itself. The program falls in an infinite loop and leads to \u201cStackOverflowError\u201d. This is a common problem in recursive programs if we don\u2019t converge to the base case.<\/p>\n <\/p>\n <\/p>\n <\/p>\n The mathematical formula for sum:<\/p>\n sum(n) = ( n*n + n )\/2 = n(n+1)\/2<\/p>\n Write a recursive method for the sum of n integers? Recursion is a method calling itself. Such a method is said to be a recursive method. A recursive algorithm is similar to Mathematical Induction problems. We assume that there is a solution for a base case, and we will prove the result for the general […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-1336","post","type-post","status-publish","format-standard","hentry","category-automation","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\/1336","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=1336"}],"version-history":[{"count":5,"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/posts\/1336\/revisions"}],"predecessor-version":[{"id":26424,"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/posts\/1336\/revisions\/26424"}],"wp:attachment":[{"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/media?parent=1336"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/categories?post=1336"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.testingdocs.com\/questions\/wp-json\/wp\/v2\/tags?post=1336"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}Sample infinite loop using recursion:<\/strong><\/h3>\n
public class InfiniteRecursion {\r\n\r\npublic static void main(String[] args) {\r\n infinity();\r\n System.out.println(\"I'm in main method.!\");\r\n }\r\n\r\npublic static void infinity(){\r\n infinity();\r\n }\r\n\r\n}<\/pre>\n![\"recursive](\"http:\/\/www.testingdocs.com\/questions\/wp-content\/uploads\/Infinite-Recursion-StackOverflowError.jpeg\" "\\"\\"")
<\/p>\n<\/h3>\n
Recursive program for Sum(n)<\/strong><\/h3>\n
import java.util.Scanner;\r\n\r\npublic class RecursiveSum {\r\n \r\n public static void main(String[] args) {\r\n Scanner in = new Scanner(System.in);\r\n System.out.println(\"Enter n\");\r\n int n = in.nextInt();\r\n System.out.println(\"Sum of n =\" + n + \" is:\" + sum(n));\r\n in.close();\r\n } \r\n \r\n public static int sum(int n){\r\n if(n==1) return 1;\r\n return n+ sum(n-1);\r\n }\r\n}<\/pre>\n![\"Recursive](\"http:\/\/www.testingdocs.com\/questions\/wp-content\/uploads\/Recursive-method-to-calculate-the-sum.jpeg\" "\\"\\"")
<\/p>\n