C++ function to generate non-repetitive combinations [closed]

I want to create a C++ function that takes a vector and makes a all possible combinations, but no word is used more than once in one combination with defined length:

std::vector<std::string> words = {"random", "test", "word", "hello", "world"};

Output for 3words would be:

randomtestword
randomtesthello
randomtestworld
randomwordtest
randomwordhello
ranodmwordworld
...

For 4 words it would be:

randomtestwordhello
randomtestwordworld
...

I have this, which allows having one that one occurrence of the word in one combination:

void Generate::generate_combinations_with_repetition(int combination_length,
                                                     std::vector<std::string> words,
                                                     std::string combination,
                                                     int current) {
    if (current == combination_length){
        std::cout << combination << '\n';
        return;
    }

    for (std::string word : words){
        std::string current_combination = combination;
        current_combination += word;
    }

    for (std::string word : words){
        generate_combinations_with_repetition(combination_length, words, combination + word, current + 1);
    }
}

and this is in for loop:

for (int i = 1; i <= combinations.size(); i++){
    generate_combinations_with_repetition(i, combinations, "", 0);
}

But I need generate_combinations_without_repetition(...){...}.