递归算法

public class Test {
    public int factorial(int n) {        
        if (n == 1 || n == 0){
            return n;
        }else{
            return n * factorial(n - 1);
        }            
    }
    public static void main(String[] args) {
        Test test = new Test();
        System.out.println(test.factorial(6));
    }
}