feat(backtracking): all combinations of k numbers out of 1...n

[nebarf]

Create all combinations of k numbers out of 1...n using backtracking

[appgurueu]

Please add a comment explaining what this does: This generates an array of sub"sets" (represented by ascendingly sorted subarrays) of size k out of n+1 numbers from 1 to n.

Could you explain why this is backtracking? A standard definition of backtracking contains

[...] removing those solutions that fail to satisfy the constraints of the problem at any point in time [...]

which I don't really see here; I'd simply call this algorithm recursive.

[nebarf]

@appgurueu Thanks for the review! Let me know if comments are clear enough