Java Recursive Algorithm

Java Recursive Algorithm

Recursive Algorithms are actually called by the program itself. When performing a recursive algorithm, you must have a clear recursion termination condition,
When this condition is met, recursion is no longer performed.

The following two basic recursive algorithms are implemented using Java:

/*** Calculate 1 + 2 + 3 +... + n and */class Recurrent {int sum = 0; int flag = 1; public void count (int number) {sum + = flag; flag ++; if (flag <= number) {count (number) ;}} public class T {public static void main (String [] args) {Recurrent r = new Recurrent (); r. count (5); System. out. println (r. sum );}}

/*** Calculate the Factorial of n */class Factorial {public long mul (int n) {if (n <= 1) {return 1 ;} else {return n * mul (n-1) ;}} public class T {public static void main (String [] args) {Factorial fac = new Factorial (); System. out. println (fac. mul (15 ));}}