Breaking News: Grepper is joining You.com. Read the official announcement!

recursion in js

Add Answer

Excited Eland answered on June 8, 2022 Popularity 6/10 Helpfulness 2/10

answer recursion in js

related recursion js

related recursive function javascript

related JavaScript Recursion

related javascript recursion

related Recursion In DOM

related recursion in javascript is it good ?

recursion in js

Comment

Recursion in JS

// program to find the factorial of a number
function factorial(x) {

    // if number is 0
    if (x === 0) {
        return 1;
    }

    // if number is positive
    else {
        return x * factorial(x - 1);
    }
}

const num = 3;

// calling factorial() if num is non-negative
if (num > 0) {
    let result = factorial(num);
    console.log(`The factorial of ${num} is ${result}`);
}

Popularity 6/10 Helpfulness 2/10 Language javascript

Source: www.programiz.com

Tags: javascript recursion

Link to this answer
Share Copy Link

Contributed on May 06 2023

Excited Eland

0 Answers Avg Quality 2/10

Closely Related Answers

recursion js

Comment

function sum(n) {
  if (n === 0) return n;
  return n + sum(n - 1);
};

Popularity 10/10 Helpfulness 4/10 Language javascript

Source: www.freecodecamp.org

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Oct 27 2023

shahul

0 Answers Avg Quality 2/10

recursive function javascript

Comment

/*
Recursion is when a function calls itself until someone stops it. 
If no one stops it then it'll recurse (call itself) forever.
*/

// program to count down numbers to 1
function countDown(number) {
    // display the number
    console.log(number);
    // decrease the number value
    const newNumber = number - 1;
    // base case
    if (newNumber > 0) {
        countDown(newNumber);
    }
}

countDown(4);
// Out put: 
4
3
2
1

Popularity 10/10 Helpfulness 3/10 Language javascript

Source: Grepper

Tags: function functio

Link to this answer
Share Copy Link

Contributed on Jun 16 2022

Rasel Ahmed

0 Answers Avg Quality 2/10

JavaScript Recursion

Comment

function plus(n) {
  if (n === 0) {
    return 1; // Base case: return 1 when n is 0
  } else {
    return plus(n - 1) + 1; // Recursively call plus with n-1 and add 1
  }
}

console.log(plus(4)); // Output: 5

Popularity 9/10 Helpfulness 3/10 Language javascript

Source: chat.openai.com

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Feb 21 2024

Creepy Capuchin

0 Answers Avg Quality 2/10

javascript recursion

Comment

// Lets create a basic recursion
// num parameter set to 1 as default
function recursion(num = 1) {
  // when num is greater than 10 return (break)
  if (num > 10) return
  console.log(num)
  // if num is not greater than 10 call the function again but add 1 to num
  recursion(num + 1)
}

// logs 1 to 10
recursion()

// now lets take this to another level
// lets create a Fibonacci Sequence
function fib(num, arr = [0, 1]) {
  // if num is less than 2 return array
  if (num < 2) return arr;
  // else
  // take the second to last and last item of array with 'destructuring'
  // we take second to last item with .slice(-2) but getting the item next to it 
  // with destructuring
  // look it up when I saw this first time my mind blown
  const [secondToLast, last] = arr.slice(-2);
  
  // now if num is not less than 2
  // lets return the same function that we are inside of
  // and set to num to a minus of itsef
  // then we will use spread operator "..."
  // this means our array's items are now part of another array
  // in other words we spread the items of arr to another array
  // then lets grab the secondToLast and last variables and put it inside of new array
  // so in second loop it will look like simply this 
  // lets say in the first loop we passed number is 8
  // num will be a minus of itself
  // so we will reach another step to "2" break
  // array will be itself plus the secondToLast + last
  // the second loop will represent
  // fib(7, [0, 1, 2]) - because 0 + 1 is 2
  // and third loop will look like this
  // fib(6, [0, 1, 2, 3]) - because 1 + 2 is 3
  // until the num is less than 2
  // and if it's less than two
  // we get our array
  return fib(num - 1, [...arr, secondToLast + last])
}

console.log(
  fib(8) // logs [0,1,1,2,3,5,8,13,21]
)

Popularity 9/10 Helpfulness 3/10 Language javascript

Source: Grepper

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Oct 02 2023

Famous Fox

0 Answers Avg Quality 2/10

Recursion In DOM

Comment

function walkTree(node) {
  if (node == null) //
    return;
  // do something with node
  for (var i = 0; i < node.childNodes.length; i++) {
    walkTree(node.childNodes[i]);
  }
}

Popularity 10/10 Helpfulness 2/10 Language javascript

Source: developer.mozilla.org

Tags: dom

Link to this answer
Share Copy Link

Contributed on Jun 08 2022

Kon Ajang

0 Answers Avg Quality 2/10

recursion in javascript is it good ?

Comment

-1

don't use it

Popularity 10/10 Helpfulness 1/10 Language javascript

Source: Grepper

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Dec 19 2022

Iyed ben ali

0 Answers Avg Quality 2/10

recursion in js

Contents

More Related Answers

recursion in js

Closely Related Answers

recursion js

recursive function javascript

JavaScript Recursion

javascript recursion

Recursion In DOM

recursion in javascript is it good ?

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.