var countdown = function(value) {
if (value > 0) {
console.log(value);
return countdown(value - 1);
} else {
return value;
}
};
countdown(10);function fibonacciRecursive(n) {
if (n < 2) {
return n
}
return fibonacciRecursive(n - 1) + fibonacciRecursive(n - 2)
}
fibonacciRecursive(8);
// 21function recurse() {
// function code
recurse();
// function code
}
recurse();Recusrion:
function test(n){
if(n>0){
console.log(n)
test(n-1)
}
}
test(10)
test(20)
test(30)function countDown(fromNumber) {
console.log(fromNumber);
let nextNumber = fromNumber - 1;
if (nextNumber > 0) {
countDown(nextNumber);
}
}
countDown(3);
Code language: JavaScript (javascript)function walkTree(node) {
if (node == null) //
return;
// do something with node
for (var i = 0; i < node.childNodes.length; i++) {
walkTree(node.childNodes[i]);
}
}