Javascript递归实现阶乘与斐波那契数列
递归的经典用法
<script type="text/javascript">
//Javascript递归实现阶乘
function factorial(num) {
if (num <= 1)
return 1;
else
return factorial(num -1) * num;
}
//递归实现斐波那契数列 Fibonacci sequence
function fibonacciSequence(num) {
if (num <= 2)
return 1;
else
return fibonacciSequence(num - 1) + fibonacciSequence(num - 2);
}
</script>