Solutions to the combination problem.
Enumerate all possible combinations of k integers between 1 and n.
A recursive solution to the k-combination problem where the underlying data structure is an abacus of length n with k beads. The abacus is recursively truncated while beads are moved sequentially to the right.