Improve company productivity with a Business Account.Sign Up

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 202
  • Last Modified:

sorting substrings

I want to read a string from the file. Whole String: we, thank, you,

I want out put in the form of

Thank, you, we,
We, thank, you,
You, thank, we,

Note: Resulted strings are combination of their words and are arranged in alphabetical order i.e. t, w, y.


0
redgreenred
Asked:
redgreenred
1 Solution
 
AlexVirochovskyCommented:
Again homework.
0
 
jasonclarkeCommented:
#pragma warning(disable:4786)

#include <string>
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;

vector<string>
ExtractAndSortWords(const std::string& line)
{
    const string delims = " \t,";

    vector<string> words;

    string::size_type begIdx = line.find_first_not_of(delims);
    while (begIdx != string::npos)
    {
        string::size_type endIdx = line.find_first_of(delims, begIdx);

        words.push_back(line.substr(begIdx, endIdx-begIdx));

        begIdx = line.find_first_not_of(delims, endIdx);
    }

    std::sort(words.begin(), words.end());  
       
    return words;
}


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

    vector<string> sortedWords = ExtractAndSortWords(line);

    for (size_t i=0; i<sortedWords.size(); i++)
    {
        cout << sortedWords[i] << endl;
    }

    return 0;
}

0
 
mikeblasCommented:
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
0
Get your problem seen by more experts

Be seen. Boost your question’s priority for more expert views and faster solutions

 
redgreenredAuthor Commented:
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
0
 
jasonclarkeCommented:
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.
0
 
redgreenredAuthor Commented:
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
0
 
jasonclarkeCommented:
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.
0
 
jasonclarkeCommented:
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;
}
0
 
jasonclarkeCommented:
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;
}
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

Join & Write a Comment

Featured Post

Keep up with what's happening at Experts Exchange!

Sign up to receive Decoded, a new monthly digest with product updates, feature release info, continuing education opportunities, and more.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now