java遞歸算法

package QianFeng03;
//階乘(遞歸算法)
public class FactorialTest {
    public static void main(String[] args){
        int result = factor1( 10);
        System.out.println(result);
        int result1 = factor(10);
        System.out.println("遞歸算法:內存消耗大容易內存溢出"+result1);
    }
    //---------------遞歸算法,方法本身調用自己----------------------
    public static int factor(int num){
        if (num==1)
            return 1;
        return num*factor(num-1);
    }

    //---------------普通計算----------------------
    public static int factor1(int num){
        int result = num;
        int i= num-1;
        do{
            result = result*i;
            i--;
        }while (i>1);
        return result;
    }
}

簡單的遞歸概念----------