Tell us what’s happening: I understand how basic function recursion works, the function is simply re-called within the function I understand that the function is calling itself and only when n <= 0 is false, then executes: return js multiply(arr, n - 1) * arr[n]; I understand that n is bei…

I highly recommend doing this: Run the code in the Chrome Developer tools in the debugging mode is a great way to see it all happen, and visually explains the execution so well. At least for myself. You will then be able to see the recursion in operation, the call stack, and the local memory alloca…

n = 3: multiply(arr, 3-1) * arr[3] n = 2: multiply(arr, 2-1) * arr[2] n = 1: multiply(arr, 1-1) * arr[1] n = 0: arr[0] = 1 And now, as you got to the end of recursion and have the function result for n = 0, you can kind of go back. (n=1) multiply(arr, 0) * arr[1] = 1 * 2 (n=2) multiply(arr, 1) * a…

I think that this thread is the best so far at explaining what is happening here. A few different people have chimed in with how they explain recursion. [image] Recursion: What is actually happening here? JavaScript Ok, my problem isn’t passing the challenge. My problem is…

Regarding your second code block, is that really how it works, or is it actually as follows: (n=1) multiply(arr, 0) * arr[1] = 1 * 2 (n=2) multiply(arr, 1) * arr[2] = 2 * 3 (n=3) multiply(arr, 2) * arr[3] = 6 * 4 And when the following executes the first time, does * arr[3] actually not do anythin…

Thanks for the heads up about Chrome dev tools. I am able to step through it and see the progression of n each time, and then it proceeds to return the multiplied numbers. Does this mean that the function is looping two different times, one set of loops for N and then a second set of loops to mult…

I think I get your issue: the line return miltiply(arr, n-1) * arr[n] is executed only after the function call returns a value once multiply(arr, n-1) has a value, then the multiplication happens and only after that the obtained value is returned all the functions stay pending, waiting for a valu…

This reply is for anyone without any programming background at all. For beginners like myself learning through picking the code apart. To your answer: for every return to the if-statement conditional, there is a “newly created function execution context” and another “multiply’” function which is pl…

My secret sauce for understanding recursion is a little simpler: substitution. Let’s take a factorial function: function factorial(n) { if (n === 1) return 1; else return n * factorial(n - 1); } I hope this is familiar enough. I’m going to go ahead and turn it into an arrow function…

Ah, yes… that is the sticking point: Within the line return multiply(arr, n-1) how does multiply(arr, n-1) ever get a value that can then be multiplied by arr[n]. I get that return multiply(arr, n-1) is calling function multiply(arr, n) but at no point can I see how (arr, n-1) or (arr, n) would tu…

hi chuckadams, please see my reply to ieahleen of Replace Loops Using Recursion Clarification

Replace Loops Using Recursion Clarification

Curriculum Help

ArielLeslie February 7, 2020, 5:04pm 4

I think that this thread is the best so far at explaining what is happening here. A few different people have chimed in with how they explain recursion.

Topic		Replies	Views
Replace Loops using Recursion -1 explanation Curriculum Help javascript	55	4134	March 1, 2021
Recursion. Why multiply(arr, n) == multiply(arr, n - 1) * arr[n - 1]? Curriculum Help javascript	20	2351	April 28, 2022
Basic JavaScript: Recursion problem Curriculum Help javascript	9	1498	July 30, 2020
Need clarification Curriculum Help javascript	3	522	February 8, 2020
Basic JavaScript - Replace Loops using Recursion Curriculum Help javascript	21	1259	June 18, 2023

Replace Loops Using Recursion Clarification

Related topics