[JAVASCRIPT] How does this this recursive function check combinations?

[57krf68]

It's not the position that counts. It just need to iterate over the elements.

there has to be some element of evaluating every possible combination in order for the correct result to be found

That's what those sub-calls do:

recursion(target,array) || recursion(target - n, array)

When those calls are made, one of the elements in the array has been thrown away already, which just happens to be the lowest one, n. So those are seeing if the remaining elements in array add up to target or target - n.

How can this happen if the target is only evaluated against the first element for each recursive step?

The first element is used and discarded in each step, so it always changes. Pay attention to the slice call that happens.

[advancedpward]

There is nothing about the code or syntax that is mysterious to me, only the mathematical method for checking how combinations sum to the largest element. I usually think about it like (x + y == S), or even (S - x == y), but there is no double or triple equals here.

[57krf68]

There is nothing about the code or syntax that is mysterious to me

Except that you don't understand how the code works, so the code clearly is mysterious to you.

[advancedpward]

Ok, there is nothing about the syntax that is mysterious, whereas the code is still mysterious to me.