I would say it is
θ[r (n choose r)], the
n choose r part is the number of times the generator has to
yield and also the number of times the outer
In each iteration at least the output tuple of length
r needs to be generated, which gives the additional factor
r. The other inner loops will be
O(r) per outer iteration as well.
This is assuming that the tuple generation is actually
O(r) and that the list get/set are indeed
O(1) at least on average given the particular access pattern in the algorithm. If this is not the case, then still
Ω[r (n choose r)] though.
As usual in this kind of analysis I assumed all integer operations to be
O(1) even if their size is not bounded.