Is your cloud always on? With an Always On cloud you won't have to worry about downtime for maintenance or software application code updates, ensuring that your bottom line isn't affected.
Solved
sorting substrings
Posted on 2000-04-10
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.
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.
[X]
Welcome to Experts Exchange
Add your voice to the tech community where 5M+ people just like you are talking about what matters.
- Help others & share knowledge
- Earn cash & points
- Learn & ask questions
-
5
-
2
- +1
9 Comments
#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(del
while (begIdx != string::npos)
{
string::size_type endIdx = line.find_first_of(delims,
words.push_back(line.subst
begIdx = line.find_first_not_of(del
}
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;
}
#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(del
while (begIdx != string::npos)
{
string::size_type endIdx = line.find_first_of(delims,
words.push_back(line.subst
begIdx = line.find_first_not_of(del
}
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;
}
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
..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
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.
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
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.
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(sortedWo
{
std::string perm;
for (size_t i=0; i<sortedWords.size(); i++)
{
perm += sortedWords[i];
if (i < sortedWords.size()-1) perm += ", ";
}
permutations.push_back(per
}
std::sort(permutations.beg
for (size_t i=0; i<permutations.size(); i++)
{
cout << permutations[i] << endl;
}
return 0;
}
int main(int argc, char* argv[])
{
string line = "we, thank, you";
vector<string> sortedWords = ExtractAndSortWords(line);
vector<string> permutations;
while (next_permutation(sortedWo
{
std::string perm;
for (size_t i=0; i<sortedWords.size(); i++)
{
perm += sortedWords[i];
if (i < sortedWords.size()-1) perm += ", ";
}
permutations.push_back(per
}
std::sort(permutations.beg
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(per
morePermutations = next_permutation(sortedWor
}
std::sort(permutations.beg
for (size_t i=0; i<permutations.size(); i++)
{
cout << permutations[i] << endl;
}
return 0;
}
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(per
morePermutations = next_permutation(sortedWor
}
std::sort(permutations.beg
for (size_t i=0; i<permutations.size(); i++)
{
cout << permutations[i] << endl;
}
return 0;
}
Featured Post
ZipGrep is a utility that can list and search zip (.war, .ear, .jar, etc) archives for text patterns, without the need to extract the archive's contents.
One of a set of tools we're offering as a way to say thank you for being a part of the community.
Question has a verified solution.
If you are experiencing a similar issue, please ask a related question
In days of old, returning something by value from a function in C++ was necessarily avoided because it would, invariably, involve one or even two copies of the object being created and potentially costly calls to a copy-constructor and destructor. A…
Many modern programming languages support the concept of a property -- a class member that combines characteristics of both a data member and a method. These are sometimes called "smart fields" because you can add logic that is applied automaticall…
The goal of the video will be to teach the user the difference and consequence of passing data by value vs passing data by reference in C++. An example of passing data by value as well as an example of passing data by reference will be be given. Bot…
The viewer will learn how to pass data into a function in C++. This is one step further in using functions. Instead of only printing text onto the console, the function will be able to perform calculations with argumentents given by the user.
Suggested Courses
Course of the Month11 days, left to enroll
719 members asked questions and received personalized solutions in the past 7 days.
Join the community of 500,000 technology professionals and ask your questions.