The combinatorial number system shows that there is a bijection between the natural numbers less than $n \choose k$ and $n\choose k$ combinations. There is a greedy algorithm for unranking combinations, which one may calculate the worst-case run time for. I'm curious: is this the fastest algorithm in terms of asymptotic worst-case run time? If not, what is the fastest algorithm, and what is the worst-case run time?
Asked
Active
Viewed 62 times
