Question

I am looking for an algorithm (or a C-like implementation, no itertools available) which generates all tuples
[a_0 a_1 … a_(n-1)] such that 0 <= a_i <= i + 1. Pointers to literature are also welcome.

Answer 1

something like this?

void printTuples (int n, int[] a, int i=0) {
    if (i == n) {
        //print a
        return;
    }
    for (int j=0; j<=i+1; j++) {
        a[i] = j;
        printTuples (n, a, i+1);
    }
}