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 complexity is O(C(n,k)) which is O(n choose k).

This ends up being equivalent to O(min(n^k, n^(n-k))).