What's the fastest known algorithm for generating $k$-subsets of an $n$-set?
Knuth's Algorithm R Revolving-Door combinations is generally accepted as the current best for algorithms and time complexity for generating combinations.