I have looked at this long and hard. I understand recursion, I understand the call stack and the concept of “Last in, first out” but in this example. function countup(n) { if (n < 1) { return []; } else { const countArray = countup(n - 1); countArray.push(n); return countArray; …

when we are returning the empty array, how are we pushing to it values In this example, the only time an empty array [] is returned is when countup is called with 0 as the argument, like this: countup(0). In other words, when n === 1, this: const countArray = countup(n - 1); countArray.push(n);…

take a look at this recursion explanation: [image] freeCodeCamp Challenge Guide: Use Recursion to Create a Countdown Guide Guide to understanding recursion As it’s one of the most frequently asked questions on the forum I’ve decided to answer here, so all of you who have …

Another recursion question

Curriculum Help

ILM June 5, 2020, 6:24am 3

take a look at this recursion explanation:

Topic		Replies	Views
Recursion challenge in curriculum Curriculum Help javascript	10	590	November 14, 2021
Use Recursion to Create a Countdown Curriculum Help javascript	1	303	June 12, 2023
Noob question about Basic JS / recursion & Countdown Curriculum Help javascript	4	590	January 21, 2022
Clarify this recursion example Curriculum Help javascript	4	946	February 4, 2020
At what point is countArray defined as an array? Curriculum Help javascript	4	441	August 3, 2021

Another recursion question

Related topics