[Solved] how exactly is the recursion working in this code [closed]

Question

I’d suggest using python print function

print("")

At multiple locations to actually see the recursion happening. You would get a better idea than someone trying to explain it to you.

Although the function itself is quite simple. For every element in distances, the function subtracts the element from the required r value and checks the value with the if conditions.
If r value is zero ie, the for some elements in distance, their sum is r, a multi list is returned, which furthermore has the said elements.

At the end, the complete list of elements whose sum adds to r are appended to solution list and returned.

Accepted Answer

I’d suggest using python print function

print("")

At multiple locations to actually see the recursion happening. You would get a better idea than someone trying to explain it to you.

Although the function itself is quite simple. For every element in distances, the function subtracts the element from the required r value and checks the value with the if conditions.
If r value is zero ie, the for some elements in distance, their sum is r, a multi list is returned, which furthermore has the said elements.

At the end, the complete list of elements whose sum adds to r are appended to solution list and returned.