sorting substrings

Again homework.

This doesn't generate the sample output that redgreenred asked for.  (In fact, I'm not sure exactly what redgreenred is asking for.)

..B ekiM

What I am asking is to break a string into different combinations of its substrings like

string: aa, bb, cc,

I want my output as

aa, bb, cc,
bb, cc, aa,
cc, aa, bb,


I havent tried the above code, if it is working for the fixed string then I just have to alter it to read from the text file. But let me try it first.

thanks

OK, I missed part of what you were saying, your first message said that the words should be sorted, the code I gave sorts the words.

If you want all possible combinations of the set of words, the basic structure of what I gave is OK, since it extracts the words from the text, but you will need to add some code to generate the other combinations.

Obviously there are going to be an awful lot of combinations for anything but a small number of words.

the code is only breaking a string into three parts and then doing the sorting.

My requirement was to convert the string like this


we, thank, you
thank, you, we
you, we, thank

and then do sorting on the new strings.

thanks

its still not clear what you want.  what do you mean by 'and then do sorting on the new strings'.

You just seem to have combinations of the words.

ok, I think I understand finally, replace the main program above with the following:

int main(int argc, char* argv[])
{
    string line = "we, thank, you";

    vector<string> sortedWords = ExtractAndSortWords(line);

    vector<string> permutations;

    while (next_permutation(sortedWords.begin(), sortedWords.end()))
    {
        std::string perm;
        for (size_t i=0; i<sortedWords.size(); i++)
        {
            perm += sortedWords[i];
            if (i < sortedWords.size()-1) perm += ", ";
        }
        permutations.push_back(perm);
    }

    std::sort(permutations.begin(), permutations.end());
    for (size_t i=0; i<permutations.size(); i++)
    {
        cout << permutations[i] << endl;
    }
    return 0;
}

sorry, I noticed that the previous code misses the first permutation.  Here is the corrected code:

int main(int argc, char* argv[])
{
    string line = "we, thank, you";

    vector<string> sortedWords = ExtractAndSortWords(line);

    vector<string> permutations;

    bool morePermutations = (sortedWords.size() > 0);
    while (morePermutations)
    {
        std::string perm;
        for (size_t i=0; i<sortedWords.size(); i++)
        {
            perm += sortedWords[i];
            if (i < sortedWords.size()-1) perm += ", ";
        }
        permutations.push_back(perm);
        morePermutations = next_permutation(sortedWords.begin(), sortedWords.end());
    }

    std::sort(permutations.begin(), permutations.end());
    for (size_t i=0; i<permutations.size(); i++)
    {
        cout << permutations[i] << endl;
    }
    return 0;
}