I have no idea what recursion is/ok, wtf just happened?

[Troggy]

I think I’m in the same mindset as the OP on this problem, I do not understand how sum([2, 3, 4], 0) is returning a 1 and how [2, 3, 4][0] is returning 2.

Edit: Okay I completely overlooked sum([2, 3, 4], 0), because n=0 (sum(arr, n)) it returns 1, but I’m still confused on how you get 2 from [2,3,4][0].

Edit 2: Is [2,3,4][0] = 2 because the 0 element in the array is 2, and would [2,3,4][1] = 3?

Edit 3: It clicked for me. Some of the ways the code was written out in explanations in the post made it incredibly confusing because I wasn’t 100% sure what I was looking at.

Anyone looking for a very clear explanation of how this works look here

An unclear thing about one challenge

Hi @ilenia…I’m going to try! function sum(arr, n) { if n<=0 { return 0; } else { return sum(arr, n-1) + arr[n-1]; } } for the base case, where n<=0, it returns 0 - so whenever n gets to this point, it returns zero and stops. for larger values of n (that is, greater than or equal to 1) the function calls itself but with n-1 and it will keep doing this until n is equal to or less than zero. so… sum ([2,3,4,5] , 3) // n here is ‘3’ so does not meet the if statement and goes straight int…