Someone can explain me this recursion problem?

i understand practicly everything, I can actually works with the DOM and other stuff, but today I challenge myself doing again this challenge and I still don’t understand it.

it’s there is any good video who explains recursion 101 in a simple way?

Your code so far


function sum(arr, n) {
// Only change code below this line
if(n <= 0) {
return 0;
} else {
return sum(arr, n-1) + arr[n-1];
;}
// Only change code above this line
}

console.log(sum([2, 3, 4], 1))

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/84.0.4147.135 Safari/537.36.

Challenge: Replace Loops using Recursion

Link to the challenge:

You can read this article.

1 Like

So here’s a diagram to help you:
B0giY

2 Likes

Adding to what @GhostRoboXt graphically explains, you can also paste your code here and see how it behaves line by line.

2 Likes