js遞迴求階乘、斐波那契數列
阿新 • • 發佈:2018-12-22
1、求一個數的階乘
階乘:n! = n * (n - 1)!,0! = 1
function mul(n) { if(n==1||n==0){ return 1; } return n * mul(n-1); } mul(5);//120 //mul(5) ==> 5 * mul(4) //mul(4) ==> 4 * mul(3) //mul(3) ==> 3 * mul(2) //mul(2) ==> 2* mul(1) //求到1的階乘在逐層往上返回 //mul(2) ==> 2* 1 ==2 //mul(3) ==> 3 * mul(2) == 6 //mul(4) ==> 4 * mul(3) == 24 //mul(5) ==> 5 * mul(4) == 120
遞迴:最先求的值最後返回,且遞迴函式必須有終止的條件
2、斐波那契數列:是這樣一個數列 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89從第3項開始,每一項都等於前兩項之和
fn(n) == fn(n-1) + fn(n-2)
function fn(n){ if(n==1 || n==2) { return 1; } return fn(n-1) + fn(n-2); } fn(5); //fn(5) ==> fn(4) + fn(3) //fn(4) ==> fn(3) + fn(2) //fn(3) ==> fn(2) + fn(1) //fn(3) ==> 1 + 1 ==>2 //fn(4) ==> fn(3) + 1 ==>3 //fn(5) ==> fn(4) + 2 ==>5