all combinations of k elements out of n

Question

Can somebody provide me a link or pseudocode of a function for finding all combinations of k elements out of n? possibly in STL. I don\'t need to compute n choose k, I need

Answer 1

Create an auxiliary vector with n - k zeros followed by k ones. A zero means the element in the original container is not included, whereas one means the element is included.

Now use std::next_permutation on the auxiliary vector to get the next combination.