What's time complexity of this algorithm for finding all combinations?

Question

Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
For example

Answer 1

The time complexity is equal to the number of combinations there are.

In this case it is n choose k.