Recursion allows a method to call itself.
The following code is an example of recursion. It calculates the factorial numbers.
class Factorial {
// this is a recursive function
int fact(int n) {
int result;
if (n == 1)
return 1;
result = fact(n - 1) * n;
return result;
}
}
public class Main {
public static void main(String args[]) {
Factorial f = new Factorial();
System.out.println("Factorial of 5 is " + f.fact(5));
}
}
The output from this program is shown here:
Factorial of 5 is 120
java2s.com | Contact Us | Privacy Policy |
Copyright 2009 - 12 Demo Source and Support. All rights reserved. |
All other trademarks are property of their respective owners. |