递归

1.求和

 function sum(num){
            if(num==1){
                return 1;
            }
            return num+sum(num-1);
        } 
        document.write(sum(10));

2.阶乘

function factorial(num){
            if(num==1){
                return 1;
            }
            return num*factorial(num-1);
        } 
        document.write(factorial(4));

3.斐波拉契数列:1 1 2 3 5 8 13…

  //公式：f(n)=f(n-1)+f(n-2) 
        function fibonacci(num){
            if(num ==1 || num == 2){
                return 1;
            } 
            return fibonacci(num-1) + fibonacci(num-2);
        }
        document.write(fibonacci(5));