Coding Challenge Answers
General discussion
All replies
-
Ok my fault
So here`s the improved sol. to second problem
#include <algorithm>
#include <vector>
using namespace std;vector <string> getSortedNames(vector <string> names1,vector <string> names2)
{
vector <string> res(names1.size()+names2.size()); //Size must be declared otherwise memory problem is there ( I// don`t Know why???
sort(names1.begin(),names1.end()); // The Two Functions must be sorted one..
sort(names2.begin(),names2.end());
merge(names1.begin(),names1.end(),names2.begin(),names2.end(),res.begin());
return res;
}
int main(int argc, char *argv[])
{
vector <string> s1,s2,s3;
string names1[9] = {"Clark","Harris","Smith","Davis","King","Adams","Campbell","Mitchell","Jackson"};
string names2[5] = {"Barbara","Donald","Betty","Taylor","Anderson"};
for(int i = 0; i<9; i++)
{
s1.push_back(names1
);
}
for(int i=0; i<5; i++)
{
s2.push_back(names2);
}
s3=getSortedNames(s1,s2);
for(int i=0;i<s3.size();i++)
cout<<s3<<endl;
system("pause");
}
